On Support of Ordering in Multidimensional Data Structures

Multidimensional data structures are applied in many areas, e.g. in data mining, indexing multimedia data and text documents, and so on. There are some applications where the range query result must be ordered. A typical case is the result with tuples sorted according to values in one dimension defined by the ORDER BY clause of an SQL statement. If we use a multidimensional data structure, the result set is sorted after the range query is processed. Since the sort operation must often be processed on tuples stored in the secondary storage, an external sorting algorithm must be utilized. Therefore, this operation is time consuming especially for a large result set. In this paper, we introduce a new data structure, a variant of the R-tree, supporting a storage of ordered tuples.

[1]  Christos Faloutsos,et al.  The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.

[2]  Jeffrey Scott Vitter,et al.  Algorithms and Data Structures for External Memory , 2008, Found. Trends Theor. Comput. Sci..

[3]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[4]  Christos Faloutsos,et al.  On packing R-trees , 1993, CIKM '93.

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

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

[7]  Philippe Bonnet,et al.  Database tuning principles, experiments, and troubleshooting techniques , 2004, SGMD.

[8]  Václav Snásel,et al.  A new range query algorithm for Universal B-trees , 2006, Inf. Syst..

[9]  Sam Lightstone,et al.  Physical Database Design: the database professional's guide to exploiting indexes, views, storage, and more , 2007 .

[10]  Tapio Lahdenmäki,et al.  Relational Database Index Design and the Optimizers , 2005 .

[11]  Christos Faloutsos,et al.  Hilbert R-tree: An Improved R-tree using Fractals , 1994, VLDB.

[12]  Baiyang Liu,et al.  Global Ordering For Multi-dimensional Data: Comparison with K-means Clustering , 2009 .

[13]  Philippe Bonnet,et al.  Database tuning: principles, experiments, and troubleshooting techniques (part I) , 2002, SIGMOD '02.

[14]  Volker Markl,et al.  Integrating the UB-Tree into a Database System Kernel , 2000, VLDB.

[15]  Akhil Kumar.  G-Tree: A New Data Structure for Organizing Multidimensional Data , 1994, IEEE Trans. Knowl. Data Eng..

[16]  Elisa Bertino,et al.  Using spatial data access structures for filtering nearest neighbor queries , 2002, Data Knowl. Eng..

[17]  Takashi Masuda,et al.  Worldwide Computing and Its Applications , 1997, Lecture Notes in Computer Science.

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

[19]  Tapio Lahdenmäki,et al.  Relational Database Index Design and the Optimizers: DB2, Oracle, SQL Server, et al. , 2005 .

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

[21]  Hanan Samet,et al.  Foundations of multidimensional and metric data structures , 2006, Morgan Kaufmann series in data management systems.

[22]  Jennifer Widom,et al.  Database Systems: The Complete Book , 2001 .

[23]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

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

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

[26]  Yannis Manolopoulos,et al.  R-Trees: Theory and Applications , 2005, Advanced Information and Knowledge Processing.

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

[28]  ShashaDennis,et al.  Database tuning principles, experiments, and troubleshooting techniques , 2004 .

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

[30]  Václav Snásel,et al.  On the Efficient Processing Regular Path Expressions of an Enormous Volume of XML Data , 2007, DEXA.

[31]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[32]  A. Guttman,et al.  A Dynamic Index Structure for Spatial Searching , 1984, SIGMOD 1984.

[33]  Volker Markl,et al.  Mistral - Processing Relational Queries using a Multidimensional Access Technique , 1999, Datenbank Rundbr..

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