A new SOM-based r*-tree: Building and retrieving

Y. Feng, M. Kubo, Z. Aghbari, A. Makinouchi

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


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 strategics when nearest neighbour 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 SOM (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 SOM-based R*-tree proposed in this paper has a much better search performance than R*-tree.

Original languageEnglish
Pages (from-to)209-214
Number of pages6
JournalResearch Reports on Information Science and Electrical Engineering of Kyushu University
Issue number2
Publication statusPublished - Sept 2001
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Electrical and Electronic Engineering


Dive into the research topics of 'A new SOM-based r*-tree: Building and retrieving'. Together they form a unique fingerprint.

Cite this