Skip to main content

Multi-way Spatial Joins Using R-Trees: Methodology and Performance Evaluation

  • Conference paper
  • First Online:
Advances in Spatial Databases (SSD 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1651))

Included in the following conference series:

Abstract

We propose a new multi-way spatial join algorithm called M-way R-tree join which synchronously traverses M R-trees. The Mway R-tree join can be considered as a generalization of the 2-way R-tree join. Although a generalization of the 2-way R-tree join has recently been studied, it did not properly take into account the optimization techniques of the original algorithm. Here, we extend these optimization techniques for M-way joins. Since the join ordering was considered to be important in the M-way join literature (e.g., relational join), we especially consider the ordering of the search space restriction and the plane sweep. Additionally, we introduce indirect predicates in the M-way join and propose a further optimization technique to improve the performance of the M-way R-tree join. Through experiments using real data, we show that our optimization techniques significantly improve the performance of the M-way spatial join.

The work reported here was performed while Guang-Ho Cha was at Tongmyong University of Information Technology, Korea

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. L. Arge, O. Procopiue and S. Ramaswary, “Scalable Sweeping-Based Spatial Join”, Proc. of VLDB, 570–581, 1998.

    Google Scholar 

  2. N. Beckmann, H.-P. Kriegel, R. Schneider and B. Seeger, “The R*-tree: An Eficient and Robust Access Method for Points and Rectangles”, Proc. of ACM SIGMOD, 322–331, 1990.

    Google Scholar 

  3. T. Brinkho, H.-P. Kriegel and B. Seeger, “Eficient Processing of Spatial Joins Using R-trees”, Proc. of ACM SIGMOD, 237–246, 1993.

    Google Scholar 

  4. A. Guttman, “R-trees: A Dynamic Index Structure for Spatial Searching”, Proc. of ACM SIGMOD, 47–57, 1984.

    Google Scholar 

  5. R.H. Güting, “An Introduction to Spatial Database Systems”, VLDB Journal, Vol. 3, No. 4, 357–399, 1994.

    Article  Google Scholar 

  6. E. Horowitz and S. Sahni, “Fundamentals of Computer Algorithms”, Computer Science Press, 1978.

    Google Scholar 

  7. Y.-W. Huang, N. Jing and E.A. Rundensteiner, “Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations”, Proc. of VLDB, 396–405, 1997.

    Google Scholar 

  8. Y.E. Ioannidis and Y.C. Kang, “Left-deep vs. Bushy Trees: An Analysis of Strategy Spaces and Its Implications for Query Optimization”, Proc. of ACM SIGMOD, 168–177, 1991.

    Google Scholar 

  9. N. Koudas and K.C. Sevsik, “Size Separation Spatial Join”, Proc. of ACM SIGMOD, 324–355, 1997.

    Google Scholar 

  10. M.L. Lo and C.V. Ravishankar, “Spatial Joins Using Seeded Trees”, Proc. of ACM SIGMOD, 209–220, 1994.

    Google Scholar 

  11. M.L. Lo and C.V. Ravishankar, “Spatial Hash-Joins”, Proc. of ACM SIGMOD, 247–258, 1996.

    Google Scholar 

  12. N. Mamoulis and D. Papadias, “Integration of Spatial Join Algorithms for Processing Multiple Inputs”, to appear in Proc. of ACM SIGMOD’99.

    Google Scholar 

  13. N. Mamoulis and D. Papadias, “Synchronous R-tree Traversal”, Technical Report HKUST-CS99-03, 1999.

    Google Scholar 

  14. J.A. Orenstein, “Spatial Query Processing in an Object-Oriented Database System”, Proc. of ACM SIGMOD, 326–336, 1986.

    Google Scholar 

  15. D. Papadias, N. Mamoulis and V. Delis, “Algorithms for Querying by Spatial Structure”, Proc. of VLDB, 546–557, 1998.

    Google Scholar 

  16. D. Papadias, N. Mamoulis and Y. Theodoridis, “Processing and Optimization of Multi-way Spatial Joins Using R-trees,” to appear in Proc. of ACM PODS’99.

    Google Scholar 

  17. H.-H. Park, C.-G. Lee, Y.-J. Lee and C.-W. Chung, “Separation of Filter and Refinement Steps in Spatial Query Optimization”, KAIST, Technical Report, CS/TR-98-122, 1998. See also: http://islab.kaist.ac.kr/~hhpark/eng_tr_sfro.ps

  18. H.-H. Park, C.-G. Lee, Y.-J. Lee and C.-W. Chung, “Early Separation of Filter and Refinement Steps in Spatial Query Optimization”, Proc. of DASFAA, 161–168, 1999.

    Google Scholar 

  19. H.-H. Park, G.-H. Cha and C.-W. Chung, “Multi-way Spatial Joins Using R-trees: Methodology and Performance Evaluation”, KAIST, Technical Report, CS/TR-99-135, 1999.

    Google Scholar 

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

    Google Scholar 

  21. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, 1985.

    Google Scholar 

  22. U.S. Bureau of the Census, Washington, DC., “TIGER/Line Files, 1995, Technical Documentation.”

    Google Scholar 

  23. P. Valduriez, “Join Indices,” ACM Transactions on Database Systems, Vol.12, No. 2, 218–246, 1987.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Park, HH., Cha, GH., Chung, CW. (1999). Multi-way Spatial Joins Using R-Trees: Methodology and Performance Evaluation. In: Güting, R.H., Papadias, D., Lochovsky, F. (eds) Advances in Spatial Databases. SSD 1999. Lecture Notes in Computer Science, vol 1651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48482-5_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-48482-5_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66247-1

  • Online ISBN: 978-3-540-48482-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics