Schemes for SR-Tree packing

Modern database applications like geographic information systems, multimedia databases, and digital libraries dealing with huge volumes of high dimensional data, make use of multidimensional index structures. Among them, SR-tree has been shown to outperform the R-Tree and its variants and the SS-Tree. For static datasets, packed index structures provide better retrieval performance. This paper presents schemes for SR-Tree packing based on different pre-processing techniques. The results show that these schemes consistently outperform packed R-Tree and conventional SR-Tree structures in terms of storage space and query performance.

[1]  Hanan Samet,et al.  A population analysis for hierarchical data structures , 1987, SIGMOD '87.

[2]  Z. Meral Özsoyoglu,et al.  Indexing large metric spaces for similarity search queries , 1999, TODS.

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

[4]  Bernhard Seeger,et al.  A Generic Approach to Bulk Loading Multidimensional Index Structures , 1997, VLDB.

[5]  J. T. Robinson,et al.  The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.

[6]  Jon Louis Bentley,et al.  Multidimensional Binary Search Trees in Database Applications , 1979, IEEE Transactions on Software Engineering.

[7]  Georgios Evangelidis,et al.  The hB $^\Pi$-tree: a multi-attribute index supporting concurrency, recovery and node consolidation , 1997, The VLDB Journal.

[8]  Ramesh C. Jain,et al.  Similarity indexing with the SS-tree , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[9]  Nick Roussopoulos,et al.  Faloutsos: "the r+- tree: a dynamic index for multidimensional objects , 1987 .

[10]  Nick Roussopoulos,et al.  Direct spatial search on pictorial databases using packed R-trees , 1985, SIGMOD Conference.

[11]  Elke A. Rundensteiner,et al.  Bulk-Insertions into R-Trees , 1998 .

[12]  Mario A. López,et al.  STR: a simple and efficient algorithm for R-tree packing , 1997, Proceedings 13th International Conference on Data Engineering.

[13]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

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

[15]  Hans-Jörg Schek,et al.  A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces , 1998, VLDB.

[16]  Le Gruenwald,et al.  Tree-Based Indexes for Image Data , 1998, J. Vis. Commun. Image Represent..

[17]  Timos K. Sellis,et al.  Topological relations in the world of minimum bounding rectangles: a study with R-trees , 1995, SIGMOD '95.

[18]  Weimin Zheng,et al.  GPR-Tree: a global parallel index structure for multiattribute declustering on cluster of workstations , 1997, Proceedings. Advances in Parallel and Distributed Computing.

[19]  Jon Louis Bentley,et al.  Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.

[20]  Scott T. Leutenegger,et al.  Master-client R-trees: a new parallel R-tree architecture , 1999, Proceedings. Eleventh International Conference on Scientific and Statistical Database Management.

[21]  BozkayaTolga,et al.  Indexing large metric spaces for similarity search queries , 1999 .

[22]  Jürg Nievergelt,et al.  The Grid File: An Adaptable, Symmetric Multikey File Structure , 1984, TODS.

[23]  D. B. Lomet,et al.  A robust multi-attribute search structure , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

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

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

[26]  Qi Yang,et al.  MB+-Tree: A New Index Structure for Multimedia Databases , 1995, IW-MMDBMS.

[27]  Jeff A. Bilmes,et al.  Tree-Based Access Methods for Spatial Databases: Implementation and Performance Evaluation , 1991, IEEE Trans. Knowl. Data Eng..

[28]  Peter Widmayer,et al.  Spatial Data Structures: Concepts and Design Choices , 1996, Algorithmic Foundations of Geographic Information Systems.

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

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

[31]  Mario A. López,et al.  High dimensional similarity search with space filling curves , 2001, Proceedings 17th International Conference on Data Engineering.

[32]  Hans-Peter Kriegel,et al.  Performance Comparison of Point and Spatial Access Methods , 1990, SSD.

[33]  Klaus H. Hinrichs,et al.  Implementation of the grid file: Design concepts and experience , 1985, BIT.

[34]  Christos Faloutsos,et al.  Fractals for secondary key retrieval , 1989, PODS.

[35]  Z. Meral Özsoyoglu,et al.  Distance-based indexing for high-dimensional metric spaces , 1997, SIGMOD '97.

[36]  Jack A. Orenstein.  Multidimensional Tries Used for Associative Searching , 1982, Inf. Process. Lett..

[37]  Peter J. H. King,et al.  Using Space-Filling Curves for Multi-dimensional Indexing , 2000, BNCOD.

[38]  Ben Shneiderman,et al.  Data structures for dynamic queries: an analytical and experimental evaluation , 1994, AVI '94.

[39]  Ramesh C. Jain,et al.  Similarity indexing: algorithms and performance , 1996, Electronic Imaging.

[40]  Nick Roussopoulos,et al.  Nearest neighbor queries , 1995, SIGMOD '95.

[41]  Hans-Peter Kriegel,et al.  The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems , 1990, VLDB.

[42]  Christos Faloutsos,et al.  Fast Nearest Neighbor Search in Medical Image Databases , 1996, VLDB.

[43]  Yannis Manolopoulos,et al.  Performance of Nearest Neighbor Queries in R-Trees , 1997, ICDT.

[44]  J. Hellerstein,et al.  Near-Neighbor Query Performance in Search Trees , 1998 .

[45]  Jürg Nievergelt,et al.  Spatial Data Structures: Concepts and Design Choices , 2000, Handbook of Computational Geometry.

[46]  Doron Rotem.  Spatial join indices , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

[47]  Petr Kuba,et al.  Data structures for spatial data mining , 2001 .

[48]  Bernhard Seeger.  Performance Comparison of Segment Access Methods Implemented on Top of the Buddy-Tree , 1991, SSD.

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

[50]  Curtis P. Kolovson,et al.  Indexing techniques for multi-dimensional spatial data and historical data in database management systems , 1991 .

[51]  David B. Lomet,et al.  A review of recent work on multi-attribute access methods , 1992, SGMD.

[52]  Rudolf Bayer,et al.  Organization and maintenance of large ordered indexes , 1972, Acta Informatica.

[53]  Octavian Procopiuc,et al.  Data Structures for Spatial Database Systems , 1997 .

[54]  Diane Greene,et al.  An implementation and performance analysis of spatial data access methods , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[55]  Christian Böhm,et al.  Efficient Bulk Loading of Large High-Dimensional Indexes , 1999, DaWaK.

[56]  David B. Lomet,et al.  The hB-tree: a multiattribute indexing method with good guaranteed performance , 1990, TODS.

[57]  Hanan Samet,et al.  Spatial Data Structures , 1995, Modern Database Systems.

[58]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[59]  Masaru Kitsuregawa,et al.  Parallel R-tree spatial join for a shared-nothing architecture , 1999, Proceedings 1999 International Symposium on Database Applications in Non-Traditional Environments (DANTE'99) (Cat. No.PR00496).

[60]  Shin'ichi Satoh,et al.  The SR-tree: an index structure for high-dimensional nearest neighbor queries , 1997, SIGMOD '97.

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

[62]  Jiawei Han,et al.  Distance-associated join indices for spatial range search , 1992, [1992] Eighth International Conference on Data Engineering.

[63]  Christos Faloutsos,et al.  The TV-tree: An index structure for high-dimensional data , 1994, The VLDB Journal.

[64]  Christos Faloutsos,et al.  Parallel R-trees , 1992, SIGMOD '92.

[65]  Ralf Hartmut Güting,et al.  An introduction to spatial database systems , 1994, VLDB J..

[66]  Jiong Yang,et al.  PK-tree: A Spatial Index Structure for High Dimensional Point Data , 1998, FODO.

[67]  Peter J. H. King,et al.  Querying multi-dimensional data indexed using the Hilbert space-filling curve , 2001, SGMD.

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

[69]  Theodore Bially,et al.  Space-filling curves: Their generation and their application to bandwidth reduction , 1969, IEEE Trans. Inf. Theory.

[70]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[71]  Hans-Peter Kriegel,et al.  Techniques for Design and Implementation of Efficient Spatial Access Methods , 1988, VLDB.

[72]  Christian Böhm,et al.  Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases , 2001, CSUR.

[73]  Peter N. Yianilos,et al.  Data structures and algorithms for nearest neighbor search in general metric spaces , 1993, SODA '93.

[74]  Hans-Peter Kriegel,et al.  Fast nearest neighbor search in high-dimensional space , 1998, Proceedings 14th International Conference on Data Engineering.

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

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

[77]  Hanan Samet,et al.  A qualitative comparison study of data structures for large line segment databases , 1992, SIGMOD '92.

[78]  Hee-Kap Ahn,et al.  A survey on multidimensional access methods , 2001 .