This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Spatial Join Processing Using Corner Transformation
July/August 1999 (vol. 11 no. 4)
pp. 688-695

Abstract—Spatial join finds pairs of spatial objects having a specific spatial relationship in spatial database systems. Since spatial join is a fairly expensive operation, we need an efficient algorithm taking advantage of the characteristics of available spatial access methods. In this paper, we propose a spatial join algorithm using corner transformation and show its excellence through experiments. To the extent of authors' knowledge, the spatial join processing using corner transformation is new. In corner transformation, two regions in one file joined with two adjacent regions in the other file share a large common area. The proposed algorithm utilizes this property in order to reduce the number of disk accesses for spatial join. Experimental results show that the performance of the algorithm is generally better than that of the R*-tree based algorithm proposed by Brinkhoff et al. This is a strong indication that corner transformation is a promising category of spatial access methods and that spatial operations can be performed better in the transform space than in the original space. This reverses the common belief that transformation will adversely effect the clustering. We also briefly mention that the join algorithm based on corner transformation has a nice property of being amenable to parallel processing. We believe that our result will provide a new insight towards transformation-based processing of spatial operations.

[1] 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.
[2] T. Brinkhoff, H.-P. Kriegel, and B. Seeger, “Efficient Processing of Spatial Joins Using R-trees,” Proc. ACM SIGMOD Conf. Management of Data, 1993.
[3] T. Brinkhoff, H.-P. Kriegel, R. Schneider, and B. Seeger, “Multi-Step Processing of Spatial Joins,” Proc. ACM SIGMOD Conf. Management of Data, 1994.
[4] O. Günther, “Efficient Computation of Spatial Joins,” Proc. Ninth Conf. Data Eng., pp. 50-60, 1993.
[5] R.H. Gueting, “An Introduction to Spatial Database Systems,” VLDB J., vol.3, no. 4, pp. 357-399, Oct. 1994.
[6] 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.
[7] 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.
[8] 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.
[9] M.-L. Lo and C.V. Ravishankar, “Spatial Hash-Joins,” Proc. ACM SIGMOD, pp. 247-258, June 1996.
[10] J. Orenstein, “Spatial Query Processing in an Object-Oriented Database System,” Proc. Fifth ACM-SIGMOD Conf., pp. 326-336, 1986.
[11] B.U. Pagel, H.W. Six, and H. Toben, “The Transformation Technique for Spatial Objects Revisited,” Proc. Third Int'l Symp. Spatial Databases, SSD '93, 1993.
[12] J.M. Patel and D.J. DeWitt, “Partition Based Spatial-Merge Join,” Proc. ACM SIGMOD, pp. 259-270, June 1996.
[13] H. Samet, The Design and Analysis of Spatial Data Structures. Addison-Wesley, 1990.
[14] B. Seeger and H.-P. Kriegel, “Techniques for Design and Implementation of Efficient Spatial Access Methods,” Proc. 14th Int'l Conf. Very Large Data Bases, pp. 360–371, 1988.
[15] B. Seeger and H.-P. Kriegel, “The Buddy-Tree: An Efficient and Robust Access Method for Spatial Database Systems,” Proc. 16th Int'l Conf. Very Large Data Bases pp. 590–601, 1990.
[16] H.W. Six and P. Widmayer, “Spatial Searching in Geometric Databases,” Proc. Fourth Int'l Conf. Data Eng., pp. 496–503, 1988.
[17] J.W. Song, K.Y. Whang, and S.W. Kim, “Spatial Join Processing Using Corner Transformation,” Technical Report CS/TR-96-107, Dept. of Computer Science, KAIST, Dec. 1996.
[18] K.Y. Whang and R. Krishnamurthy, “Multilevel Grid Files,” IBM Research Report RC 11516, 1985.
[19] K.Y. Whang and R. Krishnamurthy, “The Multilevel Grid File—A Dynamic Hierarchical Multidimensional File Structure,” Proc. Second Int'l Conf. Database Systems for Advanced Applications, pp. 449–459, 1991.
[20] K.Y. Whang, S.W. Kim, and G. Wiederhold, “Dynamic Maintenance of Data Distribution for Selectivity Estimation,” VLDB J., vol. 3, no. 1, pp. 29–51, Jan. 1994.

Index Terms:
Spatial join, GIS, spatial databases, corner transformation.
Citation:
Ju-Won Song, Kyu-Young Whang, Young-Koo Lee, Min-Jae Lee, Sang-Wook Kim, "Spatial Join Processing Using Corner Transformation," IEEE Transactions on Knowledge and Data Engineering, vol. 11, no. 4, pp. 688-695, July-Aug. 1999, doi:10.1109/69.790844
Usage of this product signifies your acceptance of the Terms of Use.