This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Transform-Space View: Performing Spatial Join in the Transform Space Using Original-Space Indexes
February 2006 (vol. 18 no. 2)
pp. 245-260
Il-Yeol Song, IEEE Computer Society
Spatial joins find all pairs of objects that satisfy a given spatial relationship. In spatial joins using indexes, original-space indexes such as the R-tree are widely used. An original-space index is the one that indexes objects as represented in the original space. Since original-space indexes deal with extents of objects, it is relatively complex to optimize join algorithms using these indexes. On the other hand, transform-space indexes, which transform objects in the original space into points in the transform space and index them, deal only with points but no extents. Thus, optimization of join algorithms using these indexes can be relatively simple. However, the disadvantage of these join algorithms is that they cannot be applied to original-space indexes such as the R-tree. In this paper, we present a novel mechanism for achieving the best of these two types of algorithms. Specifically, we propose the new notion of the transform-space view and present the transform-space view join algorithm. The transform-space view is a virtual transform-space index based on an original-space index. It allows us to "interpret” or "view” an existing original-space index as a transform-space index with no space and negligible time overhead and without actually modifying the structure of the original-space index or changing object representation. The transform-space view join algorithm joins two original-space indexes in the transform space through the notion of the transform-space view. Through analysis and experiments, we verify the excellence of the transform-space view join algorithm. The transform-space view join algorithm always outperforms existing ones for all the data sets tested in terms of all three measures used: the one-pass buffer size (the minimum buffer size required for guaranteeing one disk access per page), the number of disk accesses for a given buffer size, and the wall clock time. Thus, it constitutes a lower-bound algorithm. We believe that the proposed transform-space view can be applied to developing various new spatial query processing algorithms in the transform space.

[1] 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. Seventh Int'l Conf. Extending Database Technology (EDBT), pp. 413-429, 2000.
[2] N. Beckmann, H.-P. Kriegel, and R. Schneider, “The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles,” Proc. Int'l Conf. Management of Data (ACM SIGMOD), pp. 322-331, 1990.
[3] S. Berchtold, D. Keim, and H.-P. Kriegel, “The X-Tree: An Index Structure for High-Dimensional Data,” Proc. 22nd Int'l Conf. Very Large Data Bases, pp. 28-39, 1996.
[4] T. Brinkhoff, H.-P. Kriegel, and B. Seeger, “Efficient Processing of Spatial Joins Using R-Trees,” Proc. Int'l Conf. Management of Data (ACM SIGMOD), pp. 237-246, May 1993.
[5] C. Faloutsos, “Multiattribute Hashing Using Gray-Codes,” Proc. Int'l Conf. Management of Data (ACM SIGMOD), pp. 227-238, 1986.
[6] V. Gaede and O. Günther, “Multidimensional Access Methods,” ACM Computer Surveys, vol. 30, no. 2, pp. 170–231, 1998.
[7] O. Günther, “The Cell Tree: An Object-Oriented Index Structure for Geometric Databases,” Proc. 15th IEEE Int'l Conf. Data Eng., pp. 598-605, 1989.
[8] C. Gurret and P. Rigaux, “The Sort/Sweep Algorithm: A New Method for R-Tree Based Spatial Joins,” Proc. 12th Int'l Conf. Scientific and Statistical Database Management (SSDBM), pp. 153-165, 2000.
[9] A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” Proc. Int'l Conf. Management of Data (ACM SIGMOD), pp 47-57, 1984.
[10] D. Hilbert, “Über die stetige Abbildung einer Linie auf Flächenstück,” Annals of Math., vol. 38, pp. 459-460, 1891.
[11] G.R. Hjaltason and H. Samet, “Distance Browsing in Spatial Databases,” ACM Trans. Database Systems, vol. 24, no. 2, pp. 265-318, June 1999.
[12] 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.
[13] E.H. Jacox and H. Samet, “Iterative Spatial Join,” ACM Trans. Database Systems, vol. 28, no. 3, pp. 230-256, Sept. 2003.
[14] H.V. Jagadish, “Spatial Search with Polyhedra,” Proc. 16th IEEE Int'l Conf. Data Eng., pp. 311-319, 1990.
[15] H.V. Jagadish, “Linear Clustering of Objects with Multiple Atributes,” Proc. Int'l Conf. Management of Data (ACM SIGMOD), pp. 332-342, May 1990.
[16] D.E. Knuth, The Art of Computer Programming, Vol. III: Sorting and Searching. Addison Wesley, 1973.
[17] J. Lee, Y. Lee, K. Whang, and I. Song, “A Region Splitting Strategy for Physical Database Design of Multidimensional File Organizations,” Proc. 23rd Int'l Conf. Very Large Data Bases, pp. 416-425, 1997.
[18] M. Lee, K. Whang, W. Han, and I. Song, “Adaptive Row Major Order: A New Space Filling Curve for Efficient Spatial Join Processing in the Transform Space,” J. Systems and Software, Oct. 2004.
[19] M.-L. Lo and C.V. Ravishankar, “Spatial Joins Using Seeded Trees,” Proc. Int'l Conf. Management of Data (ACM SIGMOD), pp. 209-220, May 1994.
[20] M.-L. Lo and C.V. Ravishankar, “Spatial Hash-Joins,” Proc. Int'l Conf. Management of Data (ACM SIGMOD), pp. 247-258, June 1996.
[21] N. Mamoulis and D. Papadias, “Slot Index Spatial Join,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 1, pp. 211-231, Jan./Feb. 2003.
[22] B.C. Ooi, K.J. Mcdonell, and R. Sacks-Davis, “Spatial kd-Tree: An Indexing Mechanism for Spatial Databases,” Proc. IEEE Computer Software and Applications Conf., pp. 433-438, 1987.
[23] J. Orenstein, “Spatial Query Processing in an Object-Oriented Database System,” Proc. Int'l Conf. Management of Data (ACM SIGMOD), pp. 326-336, May 1986.
[24] B.-U. Pagel, H.-W. Six, and H. Toben, “The Transformation Technique for Spatial Objects Revisited,” Proc. Third Int'l Symp. Spatial Databases (SSD), pp. 73-88, 1993.
[25] J.M. Patel and D.J. Dewitt, “Partition Based Spatial-Merge Join,” Proc. Int'l Conf. Management of Data (ACM SIGMOD), pp. 259-270, June 1996.
[26] H. Samet, The Design and Analysis of Spatial Data Structures. Addision-Wesley, 1990.
[27] 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.
[28] J. Song, K. Whang, Y. Lee, M. Lee, and S. Kim, “Spatial Join Processing Using Corner Transformation,” IEEE Trans. Knowledge and Data Eng., vol. 11, no. 4, pp. 688-695, July/Aug. 1999.
[29] K. Whang and R. Krishnamurthy, “Multilevel Grid Files,” IBM Research Report RC 11516, 1985.

Index Terms:
Index Terms- Transform-space view, adaptive row major order, spatial join, corner transformation, databases.
Citation:
Min-Jae Lee, Kyu-Young Whang, Wook-Shin Han, Il-Yeol Song, "Transform-Space View: Performing Spatial Join in the Transform Space Using Original-Space Indexes," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 2, pp. 245-260, Feb. 2006, doi:10.1109/TKDE.2006.33
Usage of this product signifies your acceptance of the Terms of Use.