書誌事項
- タイトル別名
-
- A New SOM-based R*-tree : Building and Retrieving
- アタラシイ ジコ ソシキカ マップ ニ モトヅク R tree コウチク ト ケンサク
この論文をさがす
抄録
R-trees are widely used in spatial and multi-dimensional databases. However, according to our investigation, the overlap among the leaf nodes of R-trees is serious and the objects are not well-clustered in the leaf nodes, which greatly affect the effect of the pruning strategies when nearest neighbor searching is performed and also affect the other search performance of R-trees. The forced reinsertion introduced in R*-tree can improve this problem to some extent, but can not completely solve this problem. In this study, we try to combine SUM (Self Organizing Map) technology and R*-tree technology to lessen the overlap among the leaf nodes of R*-tree and to improve the clustering degree of the objects in the leaf nodes. The experimental result shows that the SUM-based R*-tree proposed in this paper has a much better search performance than R*-tree.
収録刊行物
-
- 九州大学大学院システム情報科学紀要
-
九州大学大学院システム情報科学紀要 6 (2), 209-214, 2001-09-26
九州大学大学院システム情報科学研究院
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390572174796970240
-
- NII論文ID
- 110000579998
-
- NII書誌ID
- AN10569524
-
- DOI
- 10.15017/1515738
-
- ISSN
- 21880891
- 13423819
-
- HANDLE
- 2324/1515738
-
- NDL書誌ID
- 5932665
-
- 本文言語コード
- ja
-
- データソース種別
-
- JaLC
- IRDB
- NDL
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用可