This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Exploiting Spatial Indexes for Semijoin-Based Join Processing in Distributed Spatial Databases
November/December 2000 (vol. 12 no. 6)
pp. 920-937

Abstract—In a distributed spatial database system, a user may issue a query that relates two spatial relations not stored at the same site. Because of the sheer volume and complexity of spatial data, spatial joins between two spatial relations at different sites are expensive in terms of computation and transmission cost. In this paper, we address the problems of processing spatial joins in a distributed environment. We propose a semijoin-like operator, called the spatial semijoin, to prune away objects that will not contribute to the join result. This operator also reduces both the transmission and local processing costs for a later join operation. However, the cost of the elimination process must be taken into account, and we consider approaches to minimize these overheads. We also studied and compared two families of distributed join algorithms that are based on the spatial semijoin operator. The first is based on multidimensional approximations obtained from an index such as the R-tree, and the second is based on single-dimensional approximations obtained from object mapping. We conducted experiments on real data sets and report the results in this paper.

[1] D.J. Abel, “A${\rm {b}}^+{\hbox{-}}{\rm{tree}}$Structure for Large Quadtrees,” Int'l J. Computer Vision, Graphics, and Image Processing, vol. 27, pp. 19–31, 1983.
[2] D.J. Abel, “Some Evolutionary Paths for Spatial Database,” Proc. Int'l Symp. Next Generation Database Systems and Applications, pp. 1–10, 1993.
[3] D.J. Abel, B.C. Ooi, R. Power, K.L. Tan, G. Williams, and X. Zhou, “The Virtual Database: A Tool for Migration from Legacy Lis,” Proc. Australasian Urban and Regional Information Systems Assoc. (AURISA' 94), pp. 117–126, 1994.
[4] D.J. Abel, B.C. Ooi, K.L. Tan, R. Power, and J.X. Yu, “Spatial Join Strategies in Distributed Spatial Dbms,” Proc. Fourth Int'l Symp. Large Spatial Databases, pp. 348–367, Aug. 1995.
[5] 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.
[6] P. Bernstein and D. Chiu,“Using semijoins to solve relational queries,” J. ACM, vol. 28, pp. 25-40, 1981.
[7] 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.
[8] T. Brinkhoff, H.-P. Kriegel, R. Schneider, and B. Seeger, “Multi-Step Processing of Spatial Joins,” Proc. ACM SIGMOD Conf. Management of Data, 1994.
[9] T. Brinkhoff, H.-P. Kriegel, and B. Seeger, “Efficient Processing of Spatial Joins Using R-trees,” Proc. ACM SIGMOD Conf. Management of Data, 1993.
[10] J.L. Smith and D.J. Abel, “A Data Structure and Query Algorithm for a Database of a Real Entities,” Australian Computer J., vol. 16, no. 4, pp. 147–154, 1984.
[11] V. Gaede and O. Gunther, “Processing Joins with User-Defined Functions,” Technical Report TR-94-103, Institut fur Wirtschaftsinformatik, Humboldt-Universitat zu Berlin, 1994.
[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] N. Koudas and K.C. Sevcik, “Size Separation Spatial Join,” Proc. ACM SIGMOD, pp. 324-335, May 1997.
[16] 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.
[17] M. Lo and C.V. Ravishankar, “Spatial Joins Using Seeded Trees,” Proc. 1994 ACM SIGMOD Int'l Conf. Management of Data, pp. 209-220, 1994.
[18] M.-L. Lo and C.V. Ravishankar, “Spatial Hash-Joins,” Proc. ACM SIGMOD, pp. 247-258, June 1996.
[19] H. Lu, R. Luo, and B.C. Ooi, “Spatial Joins by Precomputation of Approximation,” Proc. Sixth Australasian Database Conf., pp. 132–142, 1995.
[20] W. Lu and J. Han, "Distance-Associated Join Indices for Spatial Range Search," Proc. Int'l Conf. Data Eng., pp. 284-292, 1992.
[21] G.M. Morton, “A Computer Oriented Geodetic Data Base and a New Technique in File Sequencing,” technical report, 1966.
[22] J. Nievergelt, H. Hinterberger, and K.C. Sevcik, "The Grid File: An Adaptable, Symmetric Multikey File Structure," ACM Trans. Database Systems, vol. 9, no. 1, pp. 38-71, Mar. 1984.
[23] J. Orenstein, “Spatial Query Processing in an Object-Oriented Database System,” Proc. Fifth ACM-SIGMOD Conf., pp. 326-336, 1986.
[24] J.A. Orenstein, "A Comparison of Spatial Query Processing Techniques for Native and Parameter Spaces," Proc. SIGMOD Int'l Conf. Management Data, pp. 343-352, ACM, 1990.
[25] J. Orenstein, “An Algorithm for Computing the Overlay of k-Dimensional Spaces,” Proc. Symp. Large Spatial Databases, pp. 381-400, Aug. 1991.
[26] T.M. Ozsu and P. Valduriez, Principles of Distributed Database Systems. Prentice Hall, 1991.
[27] J.M. Patel and D.J. DeWitt, “Partition Based Spatial-Merge Join,” Proc. ACM SIGMOD, pp. 259-270, June 1996.
[28] D. Rotem, "Spatial Join Indices," Proc. Seventh Int'l Conf. Data Eng., pp. 500-509, 1991.
[29] H. Samet, The Design and Analysis of Spatial Data Structures. Addison-Wesley, 1990.
[30] H.J. Schek, A.P.Sheth, B. D.Czejdo, eds., Proc. Third Workshop Research Issues in Data Eng.: Interoperability in Multidatabase Systems. IEEE CS Press, 1993.
[31] 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.
[32] K.C. Sevcik and N. Koudas, “Filter Trees for Managing Spatial Data Over a Range of Size Granularities,” Proc. 23rd Int'l Conf. Very Large Data Bases (VLDB '96), pp. 16–27, Sept. 1996.
[33] Tomlinson Associates Ltd., GIS Planning—Land Status and Assets Management. Office of Geographic Data Coordination, 1993.
[34] P. Valduriez, “Join Indices,” ACM Trans. Database Systems, vol. 12, no. 2, 1987.
[35] H.M. Veenhof, P.M.G. Apers, and M.A.W. Houtsma, “Optimization of N-Way Spatial Joins Using Filters,” Proc. 13th British Nat'l Conf. Databases, 1995.
[36] H.M. Veenhof, M.A.W. Houtsma, and P.M.G. Apers, “Query Optimization for Gis Using Filters,” Proc. ACM Workshop Advances in Geographic Information Systems, 1993.
[37] C.T. Yu and C.C. Chang,“Distributed query processing,” ACM Computing Surveys, vol. 16, pp. 399-433, 1984.

Index Terms:
Spatial indexes, R-tree, locational keys, distributed spatial database systems, spatial semijoin, query processing.
Citation:
Kian-Lee Tan, Beng Chin Ooi, David J. Abel, "Exploiting Spatial Indexes for Semijoin-Based Join Processing in Distributed Spatial Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 12, no. 6, pp. 920-937, Nov.-Dec. 2000, doi:10.1109/69.895802
Usage of this product signifies your acceptance of the Terms of Use.