Ravi Kanth V Kothuri
ABSTRACT
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.
- W. M. Badaway and W. Aref. On local heuristics to speed up polygon-polygon intersection tests. In Proceedings of ACM GIS International Conference, pages 97-102, 1999. Google Scholar
Digital Library
- N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R* tree: An efficient and robust access method for points and rectangles. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 322-331, 1990. Google ScholarDigital Library
- S. Berchtold, D. A. Keim, and H. P. Kreigel. The X-tree: An index structure for high dimensional data. Procof the Int. Conf. on Very Large Data Bases, 1996. Google ScholarDigital Library
- S. Berchtold, D. A. Keim, H.-P. Kriegel, and T. Seidl. A new technique for nearest neighbor search in high-dimensional space. IEEE Trans. on Knowledge and Data Engineering, 12(1):45-57, 2000. Google ScholarDigital Library
- T. Brinkhoff, H. Horn, H. P. Kriegel, and R. Schneider. A storage and access architecture for efficient query processing in spatial database systems. In Symposium on Large Spatial Databases (SSD'93), LNCS 692, 1993. Google ScholarDigital Library
- S. Defazio, A. Daoud, L. A. Smith, and J. Srinivasan. Integrating ir and rdbms using cooperative indexing. In Proc. of ACM SIGIR Conf. on Information Retrieval, pages 84-92, 1995. Google ScholarDigital Library
- M. J. Egenhofer. Reasoning aobout binary topological relations. In Symposium on Spatial Databases, pages 271-289, 1991. Google ScholarDigital Library
- M. J. Egenhofer, A. U. Frank, and J. P. Jackson. A topological data model for spatial databases. In Symposium on Spatial Databases (SSD), pages 271-289, 1989. Google ScholarDigital Library
- H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A. E. Abbadi. Approximate nearest neighbor searching in multimedia databases. In Proc. Int. Conf. on Data Engineering, pages 503-511, 2001. Google ScholarDigital Library
- P. Fischer and K. U. Hoffgen. Computing a maximum axis-aligned rectangle in a convex polygon. In Information Processing Letters, 51, pages 189-194, 1994. Google Scholar
- V. Gaede and O. Gunther. Multidimensional access methods. ACM Computing Surveys, 30(2), 1998. Google ScholarDigital Library
- Y. J. Garcia, S. T. Leutenegger, and M. A. Lopez. A greedy algorithm for bulk loading R-trees. In Proc. of ACM GIS, 1998. Google ScholarDigital Library
- A. Guttman. R-trees: A dynamic index structure for spatial searching. Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 47-57, 1984. Google ScholarDigital Library
- G. Hjaltson and H. Samet. Ranking in spatial databases. In Symposium on Spatial Databases (SSD), 1995. Google ScholarDigital Library
- N. Katayama and S. Satoh. The SR-tree: An index structure for high-dimensional nearest-neighbor queries. Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 369-380, May 1997. Google ScholarDigital Library
- M. Kornacker, C. Mohan, and J. Hellerstein. Concurrency and recovery in GiST. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 62-72, Tucson, Arizon, June 1997. Google ScholarDigital Library
- S. T. Leutenegger, M. A. Lopez, and J. M. Edgington. STR: A simple and efficient algorithm for R-tree packing. In Proc. Int. Conf. on Data Engineering, 1997. Google ScholarDigital Library
- K.-I. Lin, H. V. Jagdish, and C. Faloutsos. The TV-tree: An index structure for high-dimensional data. VLDB Journal, 3:517-542, 1994. Google ScholarDigital Library
- D. B. Lomet and B. Salzberg. The hB-tree: A multi-attribute indexing method with good guaranteed performance. Proc. ACM Symp. on Transactions of Database Systems, 15(4):625-658, December 1990. Google ScholarDigital Library
- B. C. Ooi, C. Yu, K. L. Tan, and H. V. Jagadish. Indexing the distance: an efficient method to knn processing. In Procof the Int. Conf. on Very Large Data Bases, 2001. Google ScholarDigital Library
- D. Papadis, T. Sellis, Y. Theodoridis, and M. Egenhofer. Topological relations in the world of minimum bounding rectangles: a study with r-trees. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 92-103, 1995. Google ScholarDigital Library
- K. V. Ravi Kanth, D. Agrawal, Amr El Abbadi, and Ambuj K. Singh. Dimensionality reduction for similarity searching in dynamic databases. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1998. Google ScholarDigital Library
- K. V. Ravi Kanth and Siva Ravada. Efficient processing of large spatial queries using interior approximations. In Symposium on Spatial and Temporal Databases (SSTD), 2001. Google ScholarDigital Library
- K. V. Ravi Kanth, Siva Ravada, J. Sharma, and J. Banerjee. Indexing medium-dimensionality data in oracle. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1999. Google ScholarDigital Library
- N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 71-79, May 1995. Google ScholarDigital Library
- H. Samet. Recent developments in linear quadtree-based geographic information systems. Image and Vision Computing, 5(3):187-197, Aug. 1987. Google ScholarDigital Library
- H. Samet. The design and analysis of spatial data structures. Addison-Wesley Publishing Co., 1989. Google ScholarDigital Library
- T. Sellis, N. Roussopoulos, and C. Faloutsos. The r+-tree: A dynamic index for multi-dimensional objects. Procof the Int. Conf. on Very Large Data Bases, 13:507-518, 1988. Google ScholarDigital Library
- Y. Theodoridis and T. K. Sellis. Optimization issues in r-tree construction. In Geographic Information Systems (IGIS), pages 270-273, 1994. Google ScholarDigital Library
- Y. Theodoridis and T. K. Sellis. A model for the prediction of r-tree performance. In Proc. ACM Symp. on Principles of Database Systems, 1996. Google ScholarDigital Library
- F. Wang. Relational-linear quadtree approach for two-dimensional spatial representation and manipulation. IEEE Trans. on Knowledge and Data Engineering, 3(1):118-122, Mar. 1991. Google ScholarDigital Library
- D. White and R. Jain. Algorithms and strategies for similarity retrieval. Proc. of the SPIE Conference, 1996.Google Scholar
- D. White and R. Jain. Similarity indexing with the SS-tree. Proc. Int. Conf. on Data Engineering, pages 516-523, 1996. Google ScholarDigital Library
Index Terms
- Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data
Recommendations
Speeding up construction of PMR quadtree-based spatial indexes
Spatial indexes, such as those based on the quadtree, are important in spatial databases for efficient execution of queries involving spatial constraints, especially when the queries involve spatial joins. In this paper we present a number of techniques ...
Pipelined spatial join processing for quadtree-based indexes
GIS '07: Proceedings of the 15th annual ACM international symposium on Advances in geographic information systemsSpatial join is an important yet costly operation in spatial databases. In order to speed up the execution of a spatial join, the input tables are often indexed based on their spatial attributes. The quadtree index structure is a well-known index for ...
Temporally enhanced network-constrained (TENC) R-tree
MobiGIS '16: Proceedings of the 5th ACM SIGSPATIAL International Workshop on Mobile Geographic Information SystemsThis paper describes a new Network-constrained Moving objects indexing structure, which extends the state-of-the-art for this kind of data. The indexing structure we propose is called Temporally Enhanced Network-Constrained R-tree (TENC R-tree), which ...
Comments