This Article 
 Bibliographic References 
 Add to: 
Slot Index Spatial Join
January/February 2003 (vol. 15 no. 1)
pp. 211-231

Abstract—Efficient processing of spatial joins is very important due to their high cost and frequent application in spatial databases and other areas involving multidimensional data. This paper proposes slot index spatial join (SISJ), an algorithm that joins a nonindexed data set with one indexed by an R-tree. We explore two optimization techniques that reduce the space requirements and the computational cost of SISJ and we compare it, analytically and experimentally, with other spatial join methods for two cases: 1) when the nonindexed input is read from disk and 2) when it is an intermediate result of a preceding database operator in a complex query plan. The importance of buffer splitting between consecutive join operators is also demonstrated through a two-join case study and a method that estimates the optimal splitting is proposed. Our evaluation shows that SISJ outperforms alternative methods in most cases and is suitable for limited memory conditions.

[1] L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, and J.S. Vitter, “Scalable Sweeping-Based Spatial Join,” Proc. Very Large Data Base Conf., pp. 570-581, Aug. 1998.
[2] L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, J. Vahrenhold, and J.S. Vitter, “A Unified Approach for Indexed and Non-Indexed Spatial Joins,” Proc. EDBT Conf., pp. 413-429, Mar. 2000.
[3] S. Acharya, V. Poosala, and S. Ramaswamy, Selectivity Estimation in Spatial Databases Proc. SIGMOD, June 1999.
[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, and B. Seeger, “Efficient Processing of Spatial Joins Using R-trees,” Proc. ACM SIGMOD Conf. Management of Data, 1993.
[6] J. van der Bercken, B. Seeger, and P. Widmayer, “A Generic Approach to Bulk Loading Multidimensional Index Structures,” Proc. Very Large Data Base Conf., pp. 406-415, Aug. 1997.
[7] Bureau of the Census, TIGER/Line Precensus Files: 1990 Technical Documentation, Washington DC, 1989.
[8] D.J. DeWitt, N. Kabra, J. Luo, J.M. Patel, and J.B. Yu, “Client-Server Paradise,” Proc. 20th Very Large Database Conf., pp. 558-569, 1994.
[9] V. Gaede and O. Guenther, “Multidimensional Access Methods,” ACM Computing Surveys, vol. 30, no. 2, pp. 123-169, 1998.
[10] G. Graefe, "Query Evaluation Techniques for Large Databases," ACM Computing Surveys, vol. 25, no. 2, pp. 73-170, June 1993.
[11] R.H. Güting and W. Schilling, “A Practical Divide-and-Conquer Algorithm for the Rectangle Intersection Problem,” Information Sciences, vol. 42, pp. 95-112, 1987.
[12] O. Günther, “Efficient Computation of Spatial Joins,” Proc. Ninth Conf. Data Eng., pp. 50-60, 1993.
[13] A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Conf. Management of Data, 1984.
[14] Y.W. Huang and N. Jing, “Spatial Joins Using R-Trees: Breadth-First Traversal with Global Optimizations,” Proc. 23rd Int'l Conf. Very Large Data Bases, pp. 396–405, 1997.
[15] 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.
[16] K. Kim and S.K. Cha, “Sibling Clustering of Tree-Based Spatial Indexes for Efficient Spatial Query Processing,” Proc. ACM Int'l Conf. Information and Knowledge Management, pp. 398-405, Nov. 1998.
[17] I. Kamel and C. Faloutsos, “On Packing R-Trees,” Proc. Second Int'l Conf. Information and Knowledge Management (CIKM), 1993.
[18] N. Koudas and K.C. Sevcik, “Size Separation Spatial Join,” Proc. ACM SIGMOD, pp. 324-335, May 1997.
[19] S.T. Leutenegger, M.A. Lopez, and J.M. Edgington, “Str: A Simple and Efficient Algorithm for R-Tree Packing,” Proc. Int'l Conf. Data Eng. (ICDE '97), pp. 497–506, Apr. 1997.
[20] M.L. Lo and C.V. Ravishankar, “Generating Seeded Trees from Datasets,” Proc. Int'l Symp. Large Spatial Databases (Advances in Spatial Databases: SSD '95), pp. 328-347, Aug. 1995.
[21] M.L. Lo and C.V. Ravishankar, “Spatial Hash-Joins,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 209-220, May 1996.
[22] M.L. Lo and C.V. Ravishankar, “The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins,” IEEE Trans. Knowledge and Data Eng., vol. 10, no. 1, pp. 136-151, 1998.
[23] N. Mamoulis, “Algorithms and Optimization Techniques for Complex Spatial Queries,” doctoral dissertation, Hong Kong Univ. of Science and Technology, Dept. Computer Science, 2000.
[24] N. Mamoulis and D. Papadias, “Integration of Spatial Join Algorithms for Processing Multiple Inputs,” Proc. ACM SIGMOD Conf. Management of Data, 1999.
[25] J. Orenstein, “Redundancy in Spatial Databases,” Proc. ACM SIGMOD Conf. Management of Data, 1989.
[26] J.M. Patel and D.J. DeWitt, “Partition Based Spatial-Merge Join,” Proc. ACM SIGMOD, pp. 259-270, June 1996.
[27] H.H. Park, C.G. Lee, Y.J. Lee, and C.W. Chung, “Early Separation of Filter and Refinement Steps in Spatial Query Optimization,” Proc. NATO Advanced Research Workshop (ARW) Confluence of Computer Vision and Computer Graphics (DASFAA '99), pp. 161-168, Apr. 1999.
[28] A.N. Papadopoulos, P. Rigaux, and M. Scholl, “A Performance Evaluation of Spatial Join Processing Strategies,” Proc. Int'l Symp. Large Spatial Databases (Advances in Spatial Databases: SSD '99), pp. 286-307, July 1999.
[29] F.P. Preparata and M.I. Shamos, Computational Geometry. Springer-Verlag, 1985.
[30] N. Roussopoulos and D. Leifker, “Direct Spatial Search on Pictorial Databases Using Packed R-trees,” Proc. ACM SIGMOD Conf. Management of Data, 1985.
[31] S. Shekhar, S. Ravada, A. Fetterer, X. Liu, and C.T. Lu, “Spatial Databases: Accomplishments and Research Needs,” IEEE Trans. Knowledge and Data Eng., vol. 11, no. 1, pp. 45-55, Jan./Feb. 1999.
[32] A. Silberschatz, H.F. Kort, and S. Sudarshan, Database System Concepts. McGraw-Hill, third ed., 1999.
[33] Y. Theodoridis and T. Sellis, “A Model for the Prediction of R-tree Performance,” Proc. 15th ACM Symp. Principles of Database Systems (PODS), 1996.
[34] 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.

Index Terms:
Spatial databases, query processing, join processing, database index, spatial index, buffer management.
Nikos Mamoulis, Dimitris Papadias, "Slot Index Spatial Join," IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 1, pp. 211-231, Jan.-Feb. 2003, doi:10.1109/TKDE.2003.1161591
Usage of this product signifies your acceptance of the Terms of Use.