Skip to main content
SpringerLink
Log in

A Performance Evaluation of Spatial Join Processing Strategies

  • 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 provide an evaluation of query execution plans (QEP) in the case of queries with one or two spatial joins. The QEPs assume R*-tree indexed relations and use a common set of spatial joins algorithms, among which one is a novel extension of a strategy based on an on-the-fly index creation prior to the join with another indexed relation. A common platform is used on which a set of spatial access methods and join algorithms are available. The QEPs are implemented with a general iterator-based spatial query processor, allowing for pipelined QEP execution, thus minimizing memory space required for intermediate results.

Work supported by the European Union’s TMR program (“Chorochronos” project, contract number ERBFMRX-CT96-0056) and by the 1998-1999 French-Greek bilateral protocol.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. D. Abel, V. Gaede, R. Power, and X. Zhou. Caching Strategies for Spatial Joins. GeoInformatica, 1999. To appear.

    Google Scholar 

  2. L. Arge, O. Procopiuc, S. Ramaswami, T. Suel, and J. Vitter. Scalable Sweeping Based Spatial Join. In Proc. Intl. Conf. on Very Large Data Bases, 1998.

    Google Scholar 

  3. M. Blasgen and K. Eswaran. Storage and access in relational databases. IBM System Journal, 1977.

    Google Scholar 

  4. S. Berchtold, D. Keim, and H.-P. Kriegel. The X-tree: An Index Structure for High-Dimensional Data. In Proc. Intl. Conf. on Very Large Data Bases, 1996.

    Google Scholar 

  5. T. Brinkho, H.-P. Kriegel, and B. Seeger. Eficient Processing of Spatial Joins Using R-Trees. In Proc. ACM SIGMOD Symp. on the management of Data, 1993.

    Google Scholar 

  6. N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger. The R*tree: AnEficient and Robust Access Method for Points and Rectangles. In Proc. ACM SIGMOD Intl. Symp. on the Management of Data, pages 322–331, 1990.

    Google Scholar 

  7. T. Brinkho, H.P. Kriegel, R. Schneider, and B. Seeger. Multi-Step Processing of Spatial Joins. In Proc. ACM SIGMOD Symp. on the Management of Data, pages 197–208, 1994.

    Google Scholar 

  8. L. Bouganim, O. Kapitskaia, and P. Valduriez. Memory Adaptative Scheduling for Large Query Execution. In Proc. Intl. Conf. on Information and Knowledge Management, 1998.

    Google Scholar 

  9. O. Gunther, V. Oria, P. Picouet, J.-M. Saglio, and M. Scholl. Benchmarking Spatial Joins À La Carte. In Proc. Intl. Conf. on Scientific and Statistical Databases, 1998.

    Google Scholar 

  10. G. Graefe. Query evaluation techniques for large databases. ACM Computing Surveys, 25(2):73–170, 1993.

    Article  Google Scholar 

  11. R.H. Güting and W. Schilling. A Practical Divide-and-Conquer Algorithm for the Rectangle Intersection Problem. Information Sciences, 42:95–112, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  12. O. Gunther. Eficient Computation of Spatial Joins. In Proc. IEEE Intl. Conf. on Data Engineering, pages 50–59, 1993.

    Google Scholar 

  13. A. Guttman. R-trees: A Dynamic Index Structure for Spatial Searching. In Proc. ACM SIGMOD Intl. Symp. on the Management of Data, pages 45–57, 1984.

    Google Scholar 

  14. Y.-W. Huang, N. Jing, and E.A. Rudensteiner. Spatial Joins Using Rtrees: Breadth-First Traversal with Global Optimizations. In Proc. Intl. Conf. on Very Large Data Bases, 1997.

    Google Scholar 

  15. I. Kamel and C. Faloutsos. On Packing Rtrees. In Proc. Intl. Conf. on Information and Knowledge Management (CIKM), 1993.

    Google Scholar 

  16. N. Koudas and K. C. Sevcik. Size separation spatial join. In Proc. ACM SIGMOD Symp. on the Management of Data, 1997.

    Google Scholar 

  17. S. Leutenegger, J. Edgington, and M. Lopez. STR: a Simple and Eficient Algorithm for Rtree Packing. In Proc. IEEE Intl. Conf. on Data Engineering (ICDE), 1997.

    Google Scholar 

  18. M.-L. Lo and C.V. Ravishankar. Spatial Hash-Joins. In Proc. ACM SIGMOD Symp. on the Management of Data, pages 247–258, 1996.

    Google Scholar 

  19. M.-L. Lo and C.V. Ravishankar. The Design and Implementation of Seeded Trees: An Eficient Method for Spatial Joins. IEEE Transactions on Knowledge and Data Engineering, 10(1), 1998. First published in SIGMOD’ 94.

    Google Scholar 

  20. N. Mamoulis and D. Papadias. Integration of spatial join algorithms for joining multiple inputs. In Proc. ACM SIGMOD Symp. on the Management of Data, 1999.

    Google Scholar 

  21. B. Nag and D. J. DeWitt. Memory Allocation Strategies for Complex Decision Support Queries. In Proc. Intl. Conf. on Information and Knowledge Management, 1998.

    Google Scholar 

  22. J. Nievergelt, H. Hinterger, and K.C. Sevcik. The Grid File: An Adaptable Symmetric Multikey File Structure. ACM Transactions on Database Systems, 9(1):38–71, 1984.

    Article  Google Scholar 

  23. Oracle 8 Server Concepts, Chap. 19 (The Optimizer). Oracle Technical Documentation.

    Google Scholar 

  24. J. A. Orenstein. Spatial Query Processing in an Object-Oriented Database System. In Proc. ACM SIGMOD Symp. on the Management of Data, pages 326–336, 1986.

    Google Scholar 

  25. J.M. Patel and D. J. DeWitt. Partition Based Spatial-Merge Join. In Proc. ACM SIGMOD Symp. on the Management of Data, pages 259–270, 1996.

    Google Scholar 

  26. N. Roussopoulos and D. Leifker. Direct Spatial Search on Pictorial Databases Using Packed R-Trees. In Proc. ACM SIGMOD Symp. on the Management of Data, pages 17–26, 1985.

    Google Scholar 

  27. T. Sellis, N. Roussopoulos, and C. Faloutsos. The R+Tree: A Dynamic Index for Multi-Dimensional Objects. In Proc. Intl. Conf. on Very Large Data Bases (VLDB), pages 507–518, 1987.

    Google Scholar 

  28. P. Valduriez. Join Indices. ACM Trans. on Database Systems, 12(2): 218–246, 1987.

    Article  Google Scholar 

  29. V. Gaede and O. Guenther. Multidimensional Access Methods. ACM Computing Surveys, 1998. available at http://www.icsi.berkeley.edu/oliverg/survey.ps.Z.

  30. S. B. Yao. Approximating Block Accesses in Data Base Organizations. Communication of the ACM, 20(4), 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Data Engineering Lab., Aristotle Univ., 54006, Thessaloniki, Greece

    Apostolos Papadopoulos

  2. Cedric/CNAM, 292 rue St Martin, F-75141, Paris, Cedex 03, France

    Philippe Rigaux & Michel Scholl

Authors
  1. Apostolos Papadopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe Rigaux
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michel Scholl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Praktische Informatik IV, Fernuniversität Hagen, D-58084, Hagen, Germany

    Ralf Hartmut Güting

  2. Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong, China

    Dimitris Papadias  & Fred Lochovsky  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Papadopoulos, A., Rigaux, P., Scholl, M. (1999). A Performance Evaluation of Spatial Join Processing Strategies. 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_18

Download citation

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

  • 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

Search

Navigation