Efficient processing of spatial joins with DOT-based indexing

A spatial join is a query that searches for a set of object pairs satisfying a given spatial relationship from a database. It is one of the most costly queries, and thus requires an efficient processing algorithm that fully exploits the features of the underlying spatial indexes. In our earlier work, we devised a fairly effective algorithm for processing spatial joins with double transformation (DOT) indexing, which is one of several spatial indexing schemes. However, the algorithm is restricted to only the one-dimensional cases. In this paper, we extend the algorithm for the two-dimensional cases, which are general in Geographic Information Systems (GIS) applications. We first extend DOT to two-dimensional original space. Next, we propose an efficient algorithm for processing range queries using extended DOT. This algorithm employs the quarter division technique and the tri-quarter division technique devised by analyzing the regularity of the space-filling curve used in DOT. This greatly reduces the number of space transformation operations. We then propose a novel spatial join algorithm based on this range query processing algorithm. In processing a spatial join, we determine the access order of disk pages so that we can minimize the number of disk accesses. We show the superiority of the proposed method by extensive experiments using data sets of various distributions and sizes. The experimental results reveal that the proposed method improves the performance of spatial join processing up to three times in comparison with the widely-used R-tree-based spatial join method.

[1]  H. Buchner.  The Grid File : An Adaptable , Symmetric Multikey File Structure , 2001 .

[2]  Christos Faloutsos,et al.  DOT: A Spatial Access Method Using Fractals , 1991, ICDE.

[3]  Oliver Günther,et al.  The cell tree: An index for geometric databases , 1988 .

[4]  Christos Faloutsos,et al.  Analysis of the Clustering Properties of the Hilbert Space-Filling Curve , 2001, IEEE Trans. Knowl. Data Eng..

[5]  Shihong Du,et al.  Evaluating structural and topological consistency of complex regions with broad boundaries in multi-resolution spatial databases , 2008, Inf. Sci..

[6]  Jack A. Orenstein.  Spatial query processing in an object-oriented database system , 1986, SIGMOD '86.

[7]  Christos Faloutsos,et al.  Fractals for secondary key retrieval , 1989, PODS.

[8]  Min-Jae Lee,et al.  Transform-space view: performing spatial join in the transform space using original-space indexes , 2006, IEEE Transactions on Knowledge and Data Engineering.

[9]  Timos K. Sellis,et al.  Spatio-temporal indexing for large multimedia applications , 1996, Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems.

[10]  Elke A. Rundensteiner,et al.  Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations , 1997, VLDB.

[11]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[12]  Peter Widmayer,et al.  The LSD tree: spatial access to multidimensional and non-point objects , 1989, VLDB 1989.

[13]  Ji-Tian Xiao.  A Comparison of Heuristics for Scheduling Spatial Clusters to Reduce I/O Cost in Spatial Join Processing , 2006, 2006 International Conference on Machine Learning and Cybernetics.

[14]  Young-Koo Lee,et al.  Spatial Join Processing Using Corner Transformation , 1999, IEEE Trans. Knowl. Data Eng..

[15]  Jung-Im Won,et al.  An Efficient Spatial Join Method Using DOT Index , 2007 .

[16]  Frank Manola,et al.  PROBE Spatial Data Modeling and Query Processing in an Image Database Application , 1988, IEEE Trans. Software Eng..

[17]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[18]  Yufei Tao,et al.  MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries , 2001, VLDB.

[19]  Hon Wai Leong,et al.  Multi-point queries in large spatial databases , 2007 .

[20]  Peter J. H. King,et al.  Querying multi-dimensional data indexed using the Hilbert space-filling curve , 2001, SGMD.

[21]  Hans-Peter Kriegel,et al.  Performance Comparison of Point and Spatial Access Methods , 1990, SSD.

[22]  Jesús Manuel Almendros-Jiménez,et al.  A performance comparison of distance-based query algorithms using R-trees in spatial databases , 2007, Inf. Sci..

[23]  Bernd-Uwe Pagel,et al.  The Transformation Technique for Spatial Objects Revisited , 1993, SSD.

[24]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[25]  Po-Whei Huang,et al.  Optimizing storage utilization in R-tree dynamic index structure for spatial databases , 2001, J. Syst. Softw..

[26]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[27]  Hans-Peter Kriegel,et al.  Techniques for Design and Implementation of Efficient Spatial Access Methods , 1988, VLDB.

[28]  Christian Böhm,et al.  Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases , 2001, CSUR.

[29]  B. C. Brookes,et al.  Information Sciences , 2020, Cognitive Skills You Need for the 21st Century.

[30]  Christos Faloutsos,et al.  The A dynamic index for multidimensional ob-jects , 1987, Very Large Data Bases Conference.

[31]  Hans-Peter Kriegel,et al.  Efficient processing of spatial joins using R-trees , 1993, SIGMOD Conference.

[32]  Hung-Chi Su,et al.  Approximation and Analytical Studies of Inter-clustering Performances of Space-Filling Curves , 2003, DRW.

[33]  Dieter Pfoser,et al.  Novel Approaches in Query Processing for Moving Object Trajectories , 2000, VLDB 2000.

[34]  Ralf Hartmut Güting,et al.  An introduction to spatial database systems , 1994, VLDB J..

[35]  Oliver Günther,et al.  Efficient computation of spatial joins , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[36]  J. T. Robinson,et al.  The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.