A Raster Approximation For Processing of Spatial Joins

The processing of spatial joins can be greatly improved by the use of filters that reduce the need for examining the exact geometry of polygons in order to find the intersecting ones. Approximations of candidate pairs of polygons are examined using such filters. As a result, three possible sets of answers are identified: the positive one, composed of intersecting polygon pairs; the negative one, composed of nonintersecting polygon pairs; and the inconclusive one, composed of the remaining pairs of candidates. To identify all the intersecting pairs of polygons with inconclusive answers, it is necessary to have access to the representation of polygons so that an exact geometry test can take place. This article presents a polygon approximation for spatial join processing which we call four-colors raster signature (4CRS). The performance of a filter using this approximation was evaluated with real world data sets. The results showed that our approach, when compared to other approaches presented in the related literature, reduced the inconclusive answers by a factor of more than two. As a result, the need for retrieving the representation of polygons and carrying out exact geometry tests is reduced by a factor of more than two, as well. A Raster Approximation for the Processing of Spatial Joins

[1]  Oliver Günther.  Efficient Computation of Spatial Joins , 1993, ICDE.

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

[3]  Hans-Peter Kriegel,et al.  Comparison of approximations of complex objects used for approximation-based query processing in spatial database systems , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[4]  Hans-Peter Kriegel,et al.  The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.

[5]  Peter M. G. Apers,et al.  Optimisation of Spatial Joins Using Filters , 1995, BNCOD.

[6]  David F. Rogers,et al.  Procedural Elements for Computer Graphics , 1984 .

[7]  Christos Faloutsos,et al.  Analysis of n-Dimensional Quadtrees using the Hausdorff Fractal Dimension , 1996, VLDB.

[8]  Ming-Ling Lo,et al.  Spatial hash-joins , 1996, SIGMOD '96.

[9]  Hans-Peter Kriegel,et al.  Measuring the Complexity of Polygonal Objects , 1995, ACM-GIS.

[10]  Hans-Peter Kriegel,et al.  Parallel processing of spatial joins using R-trees , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[11]  Ming-Ling Lo,et al.  Generating Seeded Trees from Data Sets , 1995, SSD.

[12]  Elke A. Rundensteiner,et al.  Improving Spatial Intersect Joins Using Symbolic Intersect Detection , 1997, SSD.

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

[14]  David J. DeWitt,et al.  Partition based spatial-merge join , 1996, SIGMOD '96.

[15]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[16]  Jano Moreira de Souza,et al.  Using Rasters Approximations For Processing of Spatial Joins , 1997 .