Advertisement

A Performance Evaluation of Spatial Join Processing Strategies

  • Apostolos Papadopoulos
  • Philippe Rigaux
  • Michel Scholl
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1651)

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.

Keywords

Spatial Query Page Fault Window Query Query Processor Spatial Predicate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AGPZ99]
    D. Abel, V. Gaede, R. Power, and X. Zhou. Caching Strategies for Spatial Joins. GeoInformatica, 1999. To appear.Google Scholar
  2. [APR+98]
    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. [BE77]
    M. Blasgen and K. Eswaran. Storage and access in relational databases. IBM System Journal, 1977.Google Scholar
  4. [BKK96]
    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. [BKS93]
    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. [BKSS90]
    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. [BKSS94]
    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. [BKV98]
    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. [GOP+98]
    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. [Gra93]
    G. Graefe. Query evaluation techniques for large databases. ACM Computing Surveys, 25(2):73–170, 1993.CrossRefGoogle Scholar
  11. [GS87]
    R.H. Güting and W. Schilling. A Practical Divide-and-Conquer Algorithm for the Rectangle Intersection Problem. Information Sciences, 42:95–112, 1987.zbMATHCrossRefMathSciNetGoogle Scholar
  12. [Gun93]
    O. Gunther. Eficient Computation of Spatial Joins. In Proc. IEEE Intl. Conf. on Data Engineering, pages 50–59, 1993.Google Scholar
  13. [Gut84]
    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. [HJR97]
    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. [KF93]
    I. Kamel and C. Faloutsos. On Packing Rtrees. In Proc. Intl. Conf. on Information and Knowledge Management (CIKM), 1993.Google Scholar
  16. [KS97]
    N. Koudas and K. C. Sevcik. Size separation spatial join. In Proc. ACM SIGMOD Symp. on the Management of Data, 1997.Google Scholar
  17. [LEL97]
    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. [LR96]
    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. [LR98]
    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. [MP99]
    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. [ND98]
    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. [NHS84]
    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.CrossRefGoogle Scholar
  23. [Ora]
    Oracle 8 Server Concepts, Chap. 19 (The Optimizer). Oracle Technical Documentation.Google Scholar
  24. [Ore86]
    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. [PD96]
    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. [RL85]
    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. [SRF87]
    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. [Val87]
    P. Valduriez. Join Indices. ACM Trans. on Database Systems, 12(2): 218–246, 1987.CrossRefGoogle Scholar
  29. [VG98]
    V. Gaede and O. Guenther. Multidimensional Access Methods. ACM Computing Surveys, 1998. available at http://www.icsi.berkeley.edu/oliverg/survey.ps.Z.
  30. [Yao77]
    S. B. Yao. Approximating Block Accesses in Data Base Organizations. Communication of the ACM, 20(4), 1977.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Apostolos Papadopoulos
    • 1
  • Philippe Rigaux
    • 2
  • Michel Scholl
    • 2
  1. 1.Data Engineering Lab.Aristotle Univ.ThessalonikiGreece
  2. 2.Cedric/CNAMCedex 03France

Personalised recommendations