Issue No. 04 - July/August (1999 vol. 11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.790844
<p><b>Abstract</b>—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.</p>
Spatial join, GIS, spatial databases, corner transformation.
J. Song, M. Lee, S. Kim, K. Whang and Y. Lee, "Spatial Join Processing Using Corner Transformation," in IEEE Transactions on Knowledge & Data Engineering, vol. 11, no. , pp. 688-695, 1999.