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

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

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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
Volume6
Issue number2
Publication statusPublished - Sep 1 2001
Externally publishedYes

Fingerprint

Self organizing maps

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

A new SOM-based r*-tree : Building and retrieving. / Feng, Y.; Kubo, M.; Aghbari, Z.; Makinouchi, A.

In: Research Reports on Information Science and Electrical Engineering of Kyushu University, Vol. 6, No. 2, 01.09.2001, p. 209-214.

Research output: Contribution to journalArticle

@article{ccc4dd47ac8e4ec19df5572c8f36f690,
title = "A new SOM-based r*-tree: Building and retrieving",
abstract = "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.",
author = "Y. Feng and M. Kubo and Z. Aghbari and A. Makinouchi",
year = "2001",
month = "9",
day = "1",
language = "English",
volume = "6",
pages = "209--214",
journal = "Research Reports on Information Science and Electrical Engineering of Kyushu University",
issn = "1342-3819",
publisher = "Kyushu University, Faculty of Science",
number = "2",

}

TY - JOUR

T1 - A new SOM-based r*-tree

T2 - Building and retrieving

AU - Feng, Y.

AU - Kubo, M.

AU - Aghbari, Z.

AU - Makinouchi, A.

PY - 2001/9/1

Y1 - 2001/9/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0035454791&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035454791&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0035454791

VL - 6

SP - 209

EP - 214

JO - Research Reports on Information Science and Electrical Engineering of Kyushu University

JF - Research Reports on Information Science and Electrical Engineering of Kyushu University

SN - 1342-3819

IS - 2

ER -