新しい自己組織化マップに基づくR-tree:構築と検索

Yaokai Feng, 久保 正明, Zaher Aghbari

研究成果: Contribution to journalArticle査読

抄録

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.
寄稿の翻訳タイトルA New SOM-based R*-tree: Building and Retrieving
本文言語Japanese
ページ(範囲)209-214
ページ数6
ジャーナルResearch Reports on Information Science and Electrical Engineering of Kyushu University
6
2
DOI
出版ステータス出版済み - 9 2001

フィンガープリント 「新しい自己組織化マップに基づくR-tree:構築と検索」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル