A hybrid clustering criterion for r*-tree on business data

Yaokai Feng, Zhibin Wang, Akifumi Makinouchi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

It is well-known that multidimensional indices are efficient to improve the query performance on relational data. As one successful multi-dimensional index structure, R*-tree, a famous member of the R-tree family, is very popular. The clustering pattern of the objects (i.e., tuples in relational tables) among R*-tree leaf nodes is one of the deceive factors on performance of range queries, a popular kind of queries on business data. Then, how is the clustering pattern formed? In this paper, we point out that the insert algorithm of R*-tree, especially, its clustering criterion of choosing subtrees for new coming objects, determines the clustering pattern of the tuples among the leaf nodes. According to our discussion and observations, it becomes clear that the present clustering criterion of R*-tree can not lead to a good clustering pattern of tuples when R*-tree is applied to business data, which greatly degrades query performance. After that, a hybrid clustering criterion for the insert algorithm of R*-tree is introduced. Our discussion and experiments indicate that query performance of R*-tree on business data is improved clearly by the hybrid criterion.

Original languageEnglish
Title of host publicationICEIS 2005 - Proceedings of the 7th International Conference on Enterprise Information Systems
Pages346-352
Number of pages7
Publication statusPublished - Dec 1 2005
Event7th International Conference on Enterprise Information Systems, ICEIS 2005 - Miami, FL, United States
Duration: May 25 2005May 28 2005

Other

Other7th International Conference on Enterprise Information Systems, ICEIS 2005
CountryUnited States
CityMiami, FL
Period5/25/055/28/05

Fingerprint

Industry
Clustering
Experiments
Query
Node

All Science Journal Classification (ASJC) codes

  • Management Information Systems
  • Information Systems

Cite this

Feng, Y., Wang, Z., & Makinouchi, A. (2005). A hybrid clustering criterion for r*-tree on business data. In ICEIS 2005 - Proceedings of the 7th International Conference on Enterprise Information Systems (pp. 346-352)

A hybrid clustering criterion for r*-tree on business data. / Feng, Yaokai; Wang, Zhibin; Makinouchi, Akifumi.

ICEIS 2005 - Proceedings of the 7th International Conference on Enterprise Information Systems. 2005. p. 346-352.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Feng, Y, Wang, Z & Makinouchi, A 2005, A hybrid clustering criterion for r*-tree on business data. in ICEIS 2005 - Proceedings of the 7th International Conference on Enterprise Information Systems. pp. 346-352, 7th International Conference on Enterprise Information Systems, ICEIS 2005, Miami, FL, United States, 5/25/05.
Feng Y, Wang Z, Makinouchi A. A hybrid clustering criterion for r*-tree on business data. In ICEIS 2005 - Proceedings of the 7th International Conference on Enterprise Information Systems. 2005. p. 346-352
Feng, Yaokai ; Wang, Zhibin ; Makinouchi, Akifumi. / A hybrid clustering criterion for r*-tree on business data. ICEIS 2005 - Proceedings of the 7th International Conference on Enterprise Information Systems. 2005. pp. 346-352
@inproceedings{0e1430ce52f34c5596fb9e4b2089ba92,
title = "A hybrid clustering criterion for r*-tree on business data",
abstract = "It is well-known that multidimensional indices are efficient to improve the query performance on relational data. As one successful multi-dimensional index structure, R*-tree, a famous member of the R-tree family, is very popular. The clustering pattern of the objects (i.e., tuples in relational tables) among R*-tree leaf nodes is one of the deceive factors on performance of range queries, a popular kind of queries on business data. Then, how is the clustering pattern formed? In this paper, we point out that the insert algorithm of R*-tree, especially, its clustering criterion of choosing subtrees for new coming objects, determines the clustering pattern of the tuples among the leaf nodes. According to our discussion and observations, it becomes clear that the present clustering criterion of R*-tree can not lead to a good clustering pattern of tuples when R*-tree is applied to business data, which greatly degrades query performance. After that, a hybrid clustering criterion for the insert algorithm of R*-tree is introduced. Our discussion and experiments indicate that query performance of R*-tree on business data is improved clearly by the hybrid criterion.",
author = "Yaokai Feng and Zhibin Wang and Akifumi Makinouchi",
year = "2005",
month = "12",
day = "1",
language = "English",
isbn = "9728865198",
pages = "346--352",
booktitle = "ICEIS 2005 - Proceedings of the 7th International Conference on Enterprise Information Systems",

}

TY - GEN

T1 - A hybrid clustering criterion for r*-tree on business data

AU - Feng, Yaokai

AU - Wang, Zhibin

AU - Makinouchi, Akifumi

PY - 2005/12/1

Y1 - 2005/12/1

N2 - It is well-known that multidimensional indices are efficient to improve the query performance on relational data. As one successful multi-dimensional index structure, R*-tree, a famous member of the R-tree family, is very popular. The clustering pattern of the objects (i.e., tuples in relational tables) among R*-tree leaf nodes is one of the deceive factors on performance of range queries, a popular kind of queries on business data. Then, how is the clustering pattern formed? In this paper, we point out that the insert algorithm of R*-tree, especially, its clustering criterion of choosing subtrees for new coming objects, determines the clustering pattern of the tuples among the leaf nodes. According to our discussion and observations, it becomes clear that the present clustering criterion of R*-tree can not lead to a good clustering pattern of tuples when R*-tree is applied to business data, which greatly degrades query performance. After that, a hybrid clustering criterion for the insert algorithm of R*-tree is introduced. Our discussion and experiments indicate that query performance of R*-tree on business data is improved clearly by the hybrid criterion.

AB - It is well-known that multidimensional indices are efficient to improve the query performance on relational data. As one successful multi-dimensional index structure, R*-tree, a famous member of the R-tree family, is very popular. The clustering pattern of the objects (i.e., tuples in relational tables) among R*-tree leaf nodes is one of the deceive factors on performance of range queries, a popular kind of queries on business data. Then, how is the clustering pattern formed? In this paper, we point out that the insert algorithm of R*-tree, especially, its clustering criterion of choosing subtrees for new coming objects, determines the clustering pattern of the tuples among the leaf nodes. According to our discussion and observations, it becomes clear that the present clustering criterion of R*-tree can not lead to a good clustering pattern of tuples when R*-tree is applied to business data, which greatly degrades query performance. After that, a hybrid clustering criterion for the insert algorithm of R*-tree is introduced. Our discussion and experiments indicate that query performance of R*-tree on business data is improved clearly by the hybrid criterion.

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

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

M3 - Conference contribution

AN - SCOPUS:47349132836

SN - 9728865198

SN - 9789728865191

SP - 346

EP - 352

BT - ICEIS 2005 - Proceedings of the 7th International Conference on Enterprise Information Systems

ER -