Efficient Evaluation of Partially-Dimensional Range Queries Using Adaptive R*-tree

This paper is about how to efficiently evaluate partially-dimensional range queries, which are often used in many actual applications. If the existing multidimensional indices are employed to evaluate partially-dimensional range queries, then a great deal of information that is irrelevant to the queries also has to be read from disk. A modification of R*-tree is described in this paper to ameliorate such a situation. Discussions and experiments indicate that the proposed modification can clearly improve the performance of partially-dimensional range queries, especially for large datasets.

[1]  Hans-Peter Kriegel,et al.  The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.

[2]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[3]  Volker Markl,et al.  Improving OLAP performance by multidimensional hierarchical clustering , 1999, Proceedings. IDEAS'99. International Database Engineering and Applications Symposium (Cat. No.PR00265).

[4]  Hanan Samet,et al.  Distance browsing in spatial databases , 1999, TODS.

[5]  Yaokai Feng,et al.  Ag-Tree: A Novel Structure for Range Queries in Data Warehouse Environments , 2006, DASFAA.

[6]  Christian Böhm,et al.  Optimal Multidimensional Query Processing Using Tree Striping , 2000, DaWaK.

[7]  David J. DeWitt,et al.  On supporting containment queries in relational database management systems , 2001, SIGMOD '01.

[8]  Seokjin Hong,et al.  Efficient Execution of Range-Aggregate Queries in Data Warehouse Environments , 2001, ER.

[9]  Masatoshi Yoshikawa,et al.  The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation , 2000, VLDB.

[10]  Anastasia Ailamaki,et al.  Clotho: Decoupling memory page layout from storage organization , 2004, VLDB.

[11]  Matthew Huras,et al.  Efficient Query Processing for Multi-Dimensionally Clustered Tables in DB2 , 2003, VLDB.

[12]  Cui Yu,et al.  High-Dimensional Indexing , 2002, Lecture Notes in Computer Science.

[13]  Volker Markl,et al.  Processing operations with restrictions in RDBMS without external sorting: the Tetris algorithm , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[14]  Oliver Günther,et al.  Multidimensional access methods , 1998, CSUR.

[15]  Torsten. Grust,et al.  Accelerating XPath location steps , 2002, SIGMOD '02.