Skip to main content

A Rule-Based Optimizer for Spatial Join Algorithms

  • Chapter
Advances in Geoinformatics

Abstract

The spatial join operation combines two sets of spatial features, A and B, based on a spatial predicate [21]. Combining such pairs of spatial features in large data sets implies the execution of both Input/Output (I/O) and a large number of CPU operations. Therefore, it is both one of the most important and the most expensive operations in geographic databases systems (GDBMS).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arge, L., O. Procopiuc, O. et al. (2000) “A Unified Approach for Indexed and Non-Indexed Spatial Joins”. Proc. of 7th Int’l. Conf. on Extending Database Technology, p. 413–429, 2000.

    Google Scholar 

  2. Arge, L., Procopiuc, O. et al. (1998) “Scalable Sweeping-Based Spatial Join” Proc. of VLDB, 1998, p.570–581, 1998.

    Google Scholar 

  3. Belussi, A.; Bertino, E. and Nucita, A. (2003), “Grid Based Methods for Spatial Join Estimation” Proc. of 11TH Symp. of Advanced Databases Systems, p.49–60, 2003.

    Google Scholar 

  4. Belussi, A.; Bertino, E. and Nucita, A.(2004). “Grid Based Methods for Estimating Spatial Join Selectivity” Proc. of 12th ACM GIS, 2004.

    Google Scholar 

  5. Brinkhoff, T.; Kriegel, H.P. and Seeger, B. (1993), “Efficient processing of spatial joins using R-trees” Proc. of ACM SIGMOD, p. 237–246, 1993.

    Google Scholar 

  6. De Berg, M, M. Van Kreveld, M. Overmars and O. Schwarzkopf (2000), “Computational Geometry”, 2nd. edition. Springer-Verlag, 2000.

    Google Scholar 

  7. Dittrich, J.P. and Seeger, B. (2000), “Data Redundancy and Duplicate Detection in Spatial Join Processing” Proc. of Int’l. Conf. on Data Engineering, p. 535–543, 2000.

    Google Scholar 

  8. Fornari, M.R. and Iochpe, C. A spatial hash Join algorithm suited for small Buffer Sizes. Proc. of 12th ACM GIS, p. 118–126, 2004.

    Google Scholar 

  9. Gatti, S.D. and Magalhães, G.C. (2000), “A Comparison Among Different Syncronized Tree Transversal Algorithms for Spatial Joins” Proc. of GeoInfo, 2000-available in www.geoinfo.info.

    Google Scholar 

  10. Gurret, C. and Rigaux, P. (2000) “The Sort/Sweep Algorithm: A New Method for R-Tree Based Spatial Joins” Proc. of Statistical and Scientific Database Management, p.153–165, 2000.

    Google Scholar 

  11. Huang, Y.W. and Jing, N. (1997), “A Cost Model for Estimating the Performance of Spatial Joins Using R-Trees” Proc. of Int’l Conf. on Information and Knowledge Management, 1997.

    Google Scholar 

  12. IBM (2005), “IBM DB2 Spatial Extender-User’s Guide and Reference Version 8”, 2005.

    Google Scholar 

  13. Jacox, E.H. and Samet, H. (2003), “Iterative Spatial Join” ACM Transactions Database Systems, v.28, n.3, p. 230–256, 2003.

    Article  Google Scholar 

  14. Koudas, N. and Sevcik, K.C.. (1997) “Size Separation Spatial Join”, Proc. of ACM SIGMOD, p. 324–335, 1997.

    Google Scholar 

  15. Leutenegger, S. T.; Edgington, J. M.; Lopez, M.A. (1997) “STR: A Simple and Efficient Algorithm for R-Tree Packing”. Technical Report-TR-97-14. University of Denver, Mathematical and Computer Science Department, Denver: USA.

    Google Scholar 

  16. Lo, M-L. and C.V. Ravishankar (1996), “Spatial hash-joins” Proc. of ACM SIGMOD, 1996, p. 247–258, 1996.

    Google Scholar 

  17. Mamoulis, N. and Papadias, D. (2003), “Slot Index Spatial Join” IEEE Trans. on Knowledge and Data Engineering, v.15, n.1, p. 211–231, 2003.

    Article  Google Scholar 

  18. ORACLE, “Oracle Spatial User’s Guide and Reference 10g Release 1”, Dec., 2003.

    Google Scholar 

  19. Patel, J.M. and DeWitt, D.J. (1996), “Partition Based Spatial-Merge Join” Proc. of ACM SIGMOD, p. 259–270, 1996

    Google Scholar 

  20. REFRACTIONS RESEARCH (2005), “PostGIS Manual.” Dispon&’Ivel em http://postgis.refractions.net/docs/postgis.pdf.

    Google Scholar 

  21. Rigaux, P.; Scholl, M. and Voisard, A. (2000), “Spatial Databases with Applications to GIS”. Morgan Kaufmann Pub., 2000.

    Google Scholar 

  22. Theodoridis, Y.; Sellis, T. (1996) “A Model for the Prediction of R-Tree Performance”. Proc. of 16th. ACM Symposium on Principles of Database Systems, ACM Press, 1996, p.161–171.

    Google Scholar 

  23. Theodoridis, Y.; Stefanakis, E.; Sellis, T. “An Efficient Cost Model for Spatial Joins Using R-Trees” IEEE Transactions On Knowledge And Data Engineering, v.12, n.1, p.19–32, January, 2000

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Fornari, M., Comba, J.L.D., Iochpe, C. (2007). A Rule-Based Optimizer for Spatial Join Algorithms. In: Davis, C.A., Monteiro, A.M.V. (eds) Advances in Geoinformatics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73414-7_6

Download citation

Publish with us

Policies and ethics