Abstract
Spatial join is an expensive operation that is commonly used in spatial database systems. In order to generate efficient query plans for the queries involving spatial join operations, it is crucial to obtain accurate selectivity estimates for these operations. In this paper we introduce a framework for estimating the selectivity of spatial joins constrained by geometric selections. The center piece of the framework is Euler Histogram, which decomposes the estimation process into estimations on vertices, edges and faces. Based on the characteristics of different datasets, different probabilistic models can be plugged into the framework to provide better estimation results. To demonstrate the effectiveness of this framework, we implement it by incorporating two existing probabilistic models, and compare the performance with the Geometric Histogram [1] and the algorithm recently proposed by Mamoulis and Papadias [2].
This work was partially supported by NSF grants EIA-9818320, IIS-98-17432, EIA- 9986057 and IIS-99-70700.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ning An, Zhen-Yu Yang, and Anand Sivasubramaniam. Selectivity estimation for spatial joins. In ICDE 2001, Proceedings of the 17th International Conference on Data Engineering, pages 368–375, April 2001.
Nikos Mamoulis and Dimitris Papadias. Selectivity estimation of complex spatial queries. In SSTD’01, Proceedings of the 7th International Symposium on Spatial and Temporal Databases, July 2001.
Philippe Rigaux, Michel Scholl, and Agnès Voisard. Spatial Databases with Applications to GIS, chapter 1.3.1, page 14. Morgan Kaufmann Publishers, 2001.
R. Beigel and Egemen Tanin. The geometry of browsing. In Proceedings of the Latin American Symposium on Theoretical Informatics, 1998, Brazil, pages 331–340, 1998.
Chengyu Sun, Divyakant Agrawal, and Amr El Abbadi. Exploring spatial datasets with histograms. In ICDE 2002, Proceedings of the 18th International Conference on Data Engineering, Feburary 2002.
Christos Faloutsos, Bernhard Seeger, Agma J. M. Traina, and Caetano Traina Jr. Spatial join selectivity using power laws. SIGMOD Record, 29(2):177–188, 2000.
Chengyu Sun, Divyakant Agrawal, and Amr El Abbadi. Selectivity estimation for spatial joins with geometric selections (extended version). Technical report, Computer Science Department, University of California, Santa Barbara, 2002. http://www.cs.ucsb.edu/research/trcs/docs/2002-01.ps.
Larry C. Munn and Christopher S. Arneson. Draft 1:100,000-scale digital soils map of wyoming. Technical report, University of Wyoming Agricultural Experiment Station, 1999.
Michael Stonebraker, James Frew, Kenn Gardels, and Jeff Meredith. The sequoia 2000 benchmark. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C., May 26–28, 1993, pages 2–11, 1993.
Wael M. Badawy and Walid G. Aref. On local heuristics to speed up polygonpolygon intersection tests. In ACM-GIS’ 99, Proceedings of the 7th International Symposium on Advances in Geographic Information Systems, pages 97–102, 1999.
Ravi K. Kothuri and Siva Ravada. Efficient processing of large spatial queries using interior approximation. In Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases (SSTD 2001), pages 404–421, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, C., Agrawal, D., Abbadi, A.E. (2002). Selectivity Estimation for Spatial Joins with Geometric Selections. In: Jensen, C.S., et al. Advances in Database Technology — EDBT 2002. EDBT 2002. Lecture Notes in Computer Science, vol 2287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45876-X_38
Download citation
DOI: https://doi.org/10.1007/3-540-45876-X_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43324-8
Online ISBN: 978-3-540-45876-0
eBook Packages: Springer Book Archive