Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data

Spatial indexing has been one of the active focus areas in recent database research. Several variants of Quadtree and R-tree indexes have been proposed in database literature. In this paper, we first describe briefly our implementation of Quadtree and R-tree index structures and related optimizations in Oracle Spatial. We then examine the relative merits of two structures as implemented in Oracle Spatial and compare their performance for different types of queries and other operations. Finally, we summarize experiences with these different structures in indexing large GIS datasets in Oracle Spatial.

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

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

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

[4]  Klaus-Uwe Höffgen,et al.  Computing a Maximum Axis-Aligned Rectangle in a Convex Polygon , 1994, Information Processing Letters.

[5]  Mario A. López,et al.  A greedy algorithm for bulk loading R-trees , 1998, GIS '98.

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

[7]  Divyakant Agrawal,et al.  Approximate nearest neighbor searching in multimedia databases , 2001, Proceedings 17th International Conference on Data Engineering.

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

[9]  Beng Chin Ooi,et al.  Indexing the Distance: An Efficient Method to KNN Processing , 2001, VLDB.

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

[11]  C. Mohan,et al.  Concurrency and recovery in generalized search trees , 1997, SIGMOD '97.

[12]  Hanan Samet,et al.  Recent developments in linear quadtree-based geographic information systems , 1987, Image Vis. Comput..

[13]  Hanan Samet,et al.  Ranking in Spatial Databases , 1995, SSD.

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

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

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

[17]  Hans-Peter Kriegel,et al.  A Storage and Access Architecture for Efficient Query Processing in Spatial Database Systems , 1993, SSD.

[18]  W. Bruce Croft,et al.  Integrating IR and RDBMS using cooperative indexing , 1995, SIGIR '95.

[19]  Raj Jain,et al.  Algorithms and strategies for similarity retrieval , 1996 .

[20]  Timos K. Sellis,et al.  Optimization Issues in R-tree Construction (Extended Abstract) , 1994, IGIS.

[21]  Kothuri Venkata Ravi Kanth,et al.  Efficient Processing of Large Spatial Queries Using Interior Approximations , 2001, SSTD.

[22]  Andrew U. Frank,et al.  A Topological Data Model for Spatial Databases , 1990, SSD.

[23]  Walid G. Aref,et al.  On local heuristics to speed up polygon-polygon intersection tests , 1999, GIS '99.

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

[25]  Jay Banerjee,et al.  Indexing medium-dimensionality data in Oracle , 1999, SIGMOD '99.

[26]  Hans-Peter Kriegel,et al.  Indexing the Solution Space: A New Technique for Nearest Neighbor Search in High-Dimensional Space , 2000, IEEE Trans. Knowl. Data Eng..

[27]  Fangju Wang,et al.  Relational-Linear Quadtree Approach for Two-Dimensional Spatial Representation and Manipulation , 1991, IEEE Trans. Knowl. Data Eng..

[28]  Ambuj K. Singh,et al.  Dimensionality reduction for similarity searching in dynamic databases , 1998, SIGMOD '98.

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

[30]  Max J. Egenhofer,et al.  Reasoning about Binary Topological Relations , 1991, SSD.

[31]  Timos K. Sellis,et al.  A model for the prediction of R-tree performance , 1996, PODS.

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