Efficiency Improvement of Narrow Range Query Processing in R-tree

Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known R-tree is one of the multidimensional data structures. The R-tree is based on bounding of spatial near points by multidimensional rectangles. This data structure supports various types of queries, e.g. point and range queries. The range query retrieves all tuples of a multidimensional space in the defined query box. Narrow range query is an important type of the range query includ- ing at least one narrow dimension. Despite many variants of R-trees, narrow range query processing is inefficient. In this paper, we depict a modification of Signature R-tree: data structure for the narrow range query processing. This data structure applies signatures for a descrip- tion of tuples stored in a tree's page. We present an improvement of this technique.

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

[2]  Pavel Zezula,et al.  A Metric Index for Approximate Text Management , 2002, ISDB.

[3]  Jaroslav Pokorný,et al.  Efficient Processing of Narrow Range Queries in the R-Tree , 2006 .

[4]  Timos K. Sellis,et al.  Processing Star Queries on Hierarchically-Clustered Fact Tables , 2002, VLDB.

[5]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

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

[7]  Václav Snásel,et al.  Implementation of XPath Axes in the Multi-dimensional Approach to Indexing XML Data , 2004, EDBT Workshops.

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

[9]  Michael Freeston.  A general solution of the n-dimensional B-tree problem , 1995, SIGMOD '95.

[10]  Yannis Manolopoulos,et al.  Advanced Signature Indexing for Multimedia and Web Applications , 2003, Advances in Database Systems.

[11]  Christian Böhm,et al.  High Dimensional Indexing , 2009, Encyclopedia of Database Systems.

[12]  Yannis Manolopoulos,et al.  Advanced Database Indexing , 1999, Advances in Database Systems.

[13]  Rudolf Bayer,et al.  The Universal B-Tree for Multidimensional Indexing: general Concepts , 1997, WWCA.

[14]  Pavel Zezula,et al.  M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.

[15]  Václav Snásel,et al.  Multidimensional term indexing for efficient processing of complex queries , 2004, Kybernetika.