Abstract
A class of commonly asked queries in a spatial database is known as buffer queries. An example of such a query is to “find house-power line pairs that are within 50 meters of each other.” A buffer query involves two spatial data sets and a distance d. The answer to this query are pairs of objects from the two input sets that are within distance d of each other. This paper addresses the problem of how to evaluate this class of queries efficiently. Geometric objects are used to denote the shape and location of spatial objects. Two objects are within distance d precisely when their minimum distance (minDist) is. A fundamental problem with buffer query evaluation is to find an effective algorithm for solving the minDist problem. Such an algorithm is found and its desirability is demonstrated. Finding a fast minDist algorithm is the first step to evaluate a buffer query efficiently. It is observed that many, and even most, candidates can be determined to be in the answer without resorting to the relatively expensive minDist operation. A candidate is first evaluated with the least expensive technique - called 0-object filtering. If it fails, a more costly operation, called 1-object filtering, is applied. Finally, if both filterings fail, the most expensive minDist algorithm is invoked. To show the effectiveness of these techniques, they are incorporated into the tree join algorithm and tested with real-life as well as synthetic data sets. Extensive experiments show that the proposed algorithm outperforms existing techniques by a wide margin in both the execution time as well as IO accesses. More importantly, the performance gain improves drastically with the increase of distance values.
The full paper can be found in [5].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arge, L., Procopiuc, S., Ramaswamy, S., Suel, T. and Vitter, J. “Scalable Sweeping-based Spatial Join,” Proceedings of the 24th International Symposium on Very Large Databases, pp. 570–581, Morgan Kaufmann, 1998.
Becker, L., Giesen, A., Hinrichs, K. and Vahrenhold, J. “Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Sets,” Proceedings of the Sixth International Symposium on Advances in Spatial Databases, pp. 270–285, Hong Kong, China, 1999.
Brinkhoff, T., Kriegel, H-P and Seeger B., “Efficient Processing of Spatial Joins Using R-Trees,” Proceedings of ACM SIGMOD, Washington, D.C., 1993, pp. 237–246.
Brinkhoff, T., Kriegel, H-P, Schneider, R. and Seeger B., “Multi-Step Processing of Spatial Joins,” Proceedings of ACM SIGMOD, Washington, D.C., 1994, pp. 197–208.
Chan, E.P.F., “Evaluation of Buffer Queries in Spatial Databases,” Technical Report, CS-TR-01-09, Department of Computer Science, University of Waterloo, 2001.
Chan, E.P.F. and Ng. J.N.H., “A General and Efficient Implementation of Geometric Operators and Predicates,” Proceedings of the Fifth International Symposium on Advances in Spatial Databases, pp. 69–93, Berlin, Germany, 1997.
Chin, F. and Wang. C.A., “Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons,” IEEE Transactions on Computer, pp. 1203–1207, 1983.
Corral, A., Manolopoulos, Y., Theodoridis, Y. and Vassilakopoulos, M. “Closest Pair Queries in Spatial Databases,” Proceedings of ACM SIGMOD, Dollars, TX, 2000, pp. 189–200.
Kamel, I. and Faloutsos, C., “Hilbert R-Tree: An Improved R-Tree Using Fractals,” Proceedings of 20th VLDB, 1994, pp. 500–509.
Kriegel, H., Brinkhoff, T. and Schneider, R., “An Efficient Map Overlay Algorithm Based on Spatial Access Methods and Computational Geometry” Proceedings of the International Workshop on DBMS’s for Geographic Applications, Capri, May 12–17, 1991, pp. 194–211.
Guting, R.H. and Schilling, W., “A Practical Divide-and-Conquer Algorithm for the Rectangle Intersection Problem,” Information Sciences 42, 1987, pp. 95–112.
Guting, R.H., Ridder, T. and Schneider, M., “Implementation of ROSE Algebra: Efficient Algorithms for Realm-Based Spatial Data Types,” Proceedings of Advances in Spatial Databases-Fourth International Symposium, SSD’ 95, pp. 216–239, Portland, Maine, August 1995. Lecture Notes in Computer Science 951. Springer-Verlag.
Guttman, A., “R-trees: A Dynamic Index Structure for Spatial Searching,” Proceedings of ACM SIGMOD International Conference on Management of Data, 1984, pp. 47–57.
Huang, Y-W, Jones, M. and Rundensteiner, E., “Improving Spatial Intersect Using Symbolic Intersect Detection,” Proceedings of the Fifth International Symposium on Advances in Spatial Databases, pp. 165–177, Berlin, Germany, 1997.
Hjaltason, G.R., and Samet, H., “Incremental Distance Join Algorithms for Spatial Databases,” Proceedings of ACM SIGMOD, Seattle, WA, 1998, pp. 237–248.
Lo, M.L., and Ravishankar, C.V., “Spatial Hash-Join,” Proceedings of ACM SIGMOD, 1996, Montreal, Canada, pp. 247–258.
Mehlhorn, K. and Naher, S. “LEDA, A Platform for Combinatorial and Geometric Computing,” CACM (38), Jan. 1995, pp. 96–102.
Patel, J.M. and DeWitt, D. “Partition Based Spatial-Merge Join,” Proceedings of ACM SIGMOD, 1996, pp. 259–270.
Roussopoulos, N., Kelley, S. and Vincent, F., “Nearest Neighbor Queries,” Proceedings of ACM SIGMOD, San Jose, CA, 1995, pp. 71–79.
Zimbrao, G and de Souza, J.M., “A Raster Approximation for the Processing of Spatial Joins,” Proceedings of 24th VLDB, 1998, pp. 558–569.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chan, E.P.F. (2001). Evaluation of Buffer Queries in Spatial Databases. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds) Advances in Spatial and Temporal Databases. SSTD 2001. Lecture Notes in Computer Science, vol 2121. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47724-1_11
Download citation
DOI: https://doi.org/10.1007/3-540-47724-1_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42301-0
Online ISBN: 978-3-540-47724-2
eBook Packages: Springer Book Archive