This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Cost Models for Spatial Queries Using R-Trees
January/February 2000 (vol. 12 no. 1)
pp. 19-32

Abstract—Selection and join queries are fundamental operations in Data Base Management Systems (DBMS). Support for nontraditional data, including spatial objects, in an efficient manner is of ongoing interest in database research. Toward this goal, access methods and cost models for spatial queries are necessary tools for spatial query processing and optimization. In this paper, we present analytical models that estimate the cost (in terms of node and disk accesses) of selection and join queries using R-tree-based structures. The proposed formulae need no knowledge of the underlying R-tree structure(s) and are applicable to uniform-like and nonuniform data distributions. In addition, experimental results are presented which show the accuracy of the analytical estimations when compared to actual runs on both synthetic and real data sets.

[1] J.F. Allen, “Maintaining Knowledge about Temporal Intervals,” Comm. ACM, vol. 26, no. 11, pp. 832–843, 1983.
[2] W.G. Aref and H. Samet, “A Cost Model for Query Optimization Using R-Trees,” Proc. Second ACM Workshop Advances in GIS (ACM-GIS), 1994.
[3] T. Brinkhoff, H.-P. Kriegel, and B. Seeger, “Efficient Processing of Spatial Joins Using R-trees,” Proc. ACM SIGMOD Conf. Management of Data, 1993.
[4] N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, “The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD Conf. Management of Data, 1990.
[5] T. Brinkhoff, H.-P. Kriegel, R. Schneider, and B. Seeger, “Multi-Step Processing of Spatial Joins,” Proc. ACM SIGMOD Conf. Management of Data, 1994.
[6] Bureau of the Census, TIGER/Line Census Files, Mar. 1991.
[7] D. Comer, “The Ubiquitous B-Tree,” ACM Computing Surveys, vol. 11, no. 2, pp. 121-137, June 1979.
[8] M.J. Egenhofer and R. Franzosa, “Point Set Topological Relations,” Int'l J. Geographical Information Systems, vol. 5, pp. 161-174, 1991.
[9] C. Faloutsos, Searching Multimedia Databases by Content. Kluwer Academic, 1996.
[10] C. Faloutsos, H.V. Jagadish, and N. Sidiropoulos, “Recovering Information from Summary Data,” Proc. 23rd Int'l Conf. Very Large Data Bases (VLDB), 1997.
[11] C. Faloutsos and I. Kamel, “Beyond Uniformity and Independence: Analysis of R-Trees Using the Concept of Fractal Dimension,” Proc. 13th ACM Symp. Principles of Database Systems (PODS), 1994.
[12] M. Freeston, “The BANG File: A New Kind of Grid File,” Proc. ACM SIGMOD Conf. Management of Data, 1987.
[13] C. Faloutsos, T. Sellis, and N. Roussopoulos, “Analysis of Object Oriented Spatial Access Methods,” Proc. ACM SIGMOD Conf. Management of Data, 1987.
[14] V. Gaede and O. Guenther, “Multidimensional Access Methods,” ACM Computing Surveys, vol. 30, no. 2, pp. 123-169, 1998.
[15] R.H. Gueting, “An Introduction to Spatial Database Systems,” VLDB J., vol.3, no. 4, pp. 357-399, Oct. 1994.
[16] A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Conf. Management of Data, 1984.
[17] Y.-W. Huang, N. Jing, and E.A. Rundensteiner, “A Cost Model for Estimating the Performance of Spatial Joins Using R-trees,” Proc. Ninth Int'l Conf. Scientific and Statistical Database Management (SSDBM), 1997.
[18] A. Henrich, H.-W. Six, and P. Widmayer, “The LSD Tree: Spatial Access to Multidimensional Point and Non Point Objects,” Proc. 15th Int'l Conf. Very Large Data Bases (VLDB), 1989.
[19] I. Kamel and C. Faloutsos, “On Packing R-Trees,” Proc. Second Int'l Conf. Information and Knowledge Management (CIKM), 1993.
[20] D. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching. Addison-Wesley, 1973.
[21] S.T. Leutenegger and M.A. Lopez, “The Effect of Buffering on the Performance of R-Trees,” Proc. 14th IEEE Int'l Conf. Data Eng. (ICDE), 1998.
[22] N. Mamoulis and D. Papadias, “Integration of Spatial Join Algorithms for Processing Multiple Inputs,” Proc. ACM SIGMOD Conf. Management of Data, 1999.
[23] J. Orenstein, “Redundancy in Spatial Databases,” Proc. ACM SIGMOD Conf. Management of Data, 1989.
[24] V. Poosala and Y. Ioannidis, “Selectivity Estimation without the Attribute Value Independence Assumption,” Proc. 23rd Int'l Conf. Very Large Data Bases (VLDB), 1997.
[25] D. Papadias, N. Mamoulis, and Y. Theodoridis, “Processing and Optimization of Multi-Way Spatial Joins Using R-Trees,” Proc. 18th ACM Symp. Principles of Database Systems (PODS), 1999.
[26] F.P. Preparata and M.I. Shamos, Computational Geometry. Springer-Verlag, 1985.
[27] B.-U. Pagel and H.-W. Six, “Are Window Queries Representative for Arbitrary Range Queries?” Proc. 15th ACM Symp. Principles of Database Systems (PODS), 1996.
[28] B.-U. Pagel, H.-W. Six, H. Toben, and P. Widmayer, “Towards an Analysis of Range Query Performance,” Proc. 12th ACM Symp. Principles of Database Systems (PODS), 1993.
[29] B.-U. Pagel, H.-W. Six, and M. Winter, “Window Query-Optimal Clustering of Spatial Objects,” Proc. 14th ACM Symp. Principles of Database Systems (PODS), 1995.
[30] D. Papadias and Y. Theodoridis, “Spatial Relations, Minimum Bounding Rectangles, and Spatial Data Structures,” Int'l J. Geographic Information Science, vol. 11, no. 2, pp. 111-138, 1997.
[31] N. Roussopoulos, Y. Kotidis, and M. Roussopoulos, “Cubetree: Organization of and Bulk Updates on the Data Cube,” Proc. ACM SIGMOD Conf. Management of Data, 1997.
[32] N. Roussopoulos and D. Leifker, “Direct Spatial Search on Pictorial Databases Using Packed R-trees,” Proc. ACM SIGMOD Conf. Management of Data, 1985.
[33] H. Samet, The Design and Analysis of Spatial Data Structures. Addison-Wesley, 1990.
[34] M. Stonebraker and D. Moore, Object Relational Databases: The Next Wave. Morgan Kaufmann, 1996.
[35] T. Sellis, N. Roussopoulos, and C. Faloutsos, “The R+-Tree: A Dynamic Index for Multidimensional Objects,” Proc. 13th Int'l Conf. Very Large Data Bases (VLDB), 1987.
[36] Y. Theodoridis, D. Papadias, E. Stefanakis, and T. Sellis, “Direction Relations and Two-Dimensional Range Queries: Optimisation Techniques,” Data and Knowledge Eng., vol. 27, no. 3, pp. 313-336, Sept. 1998.
[37] Y. Theodoridis and T. Sellis, “A Model for the Prediction of R-tree Performance,” Proc. 15th ACM Symp. Principles of Database Systems (PODS), 1996.
[38] Y. Theodoridis, E. Stefanakis, and T. Sellis, “Cost Models for Join Queries in Spatial Databases,” Proc. 14th IEEE Int'l Conf. Data Eng. (ICDE), 1998.
[39] Y. Theodoridis, E. Stefanakis, and T. Sellis, “Efficient Cost Models for Spatial Queries Using R-trees,” Chorochronos Technical Report Series, CH-98-05, July 1998, http://www.dbnet.ntua.gr/~chorospublications.html .
[40] J.S. Vitter, “Faster Methods for Random Sampling,” Comm. ACM, vol. 27, no. 7, pp. 703-718, July 1984.
[41] J.S. Vitter, “Random Sampling with Reservoir,” ACM Trans. Math. Software, vol. 11, pp. 37-57, Mar. 1985.
[42] M. Vazirgiannis, Y. Theodoridis, and T. Sellis, “Spatio-Temporal Composition and Indexing for Large Multimedia Applications,” ACM/Springer Multimedia Systems, vol. 6, no. 4, pp. 284-298, July 1998.

Index Terms:
Spatial databases, access methods, query optimization, cost models, R-trees.
Citation:
Yannis Theodoridis, Emmanuel Stefanakis, Timos Sellis, "Efficient Cost Models for Spatial Queries Using R-Trees," IEEE Transactions on Knowledge and Data Engineering, vol. 12, no. 1, pp. 19-32, Jan.-Feb. 2000, doi:10.1109/69.842247
Usage of this product signifies your acceptance of the Terms of Use.