A performance evaluation of spatial join processing strategies

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1651, Issue , 1999, Pages 286-307

  Papadopoulos, Apostolos ^a   Rigaux, Philippe ^b   Scholl, Michel ^b  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

^b CEDRIC CNAM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

QUERY LANGUAGES;

COMMON PLATFORM; INDEX CREATION; INTERMEDIATE RESULTS; ON THE FLIES; QUERY EXECUTION PLAN; SPATIAL ACCESS METHODS; SPATIAL JOIN; SPATIAL QUERIES;

PIPELINE PROCESSING SYSTEMS;

EID: 84958778009     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48482-5_18     Document Type: Conference Paper

References (30)

1. D. Abel, V. Gaede, R. Power, and X. Zhou. Caching Strategies for Spatial Joins. GeoInformatica, 1999. To appear.
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.
3. M. Blasgen and K. Eswaran. Storage and access in relational databases. IBM System Journal, 1977.
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.
5. T. Brinkhoff, H.-P. Kriegel, and B. Seeger. Efficient Processing of Spatial Joins Using R-Trees. In Proc. ACM SIGMOD Symp. on the Management of Data, 1993.
6. N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger. The R*tree: An Efficient and Robust Access Method for Points and Rectangles. In Proc. ACM SIGMOD Intl. Symp. on the Management of Data, pages 322-331, 1990.
7. T. Brinkhoff, H.P. Kriegel, R. Schneider, and B. Seeger. Multi-Step Processing of Spatial Joins. In Proc. ACM SIGMOD Symp. on the Manage-ment of Data, pages 197-208, 1994.
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.
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.
10. G. Graefe. Query evaluation techniques for large databases. ACM Com-puting Surveys, 25(2):73-170, 1993.
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.
12. O. Gunther. Efficient Computation of Spatial Joins. In Proc. IEEE Intl. Conf. on Data Engineering, pages 50-59, 1993.
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.
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.
15. I. Kamel and C. Faloutsos. On Packing Rtrees. In Proc. Intl. Conf. on Information and Knowledge Management (CIKM), 1993.
16. N. Koudas and K. C. Sevcik. Size separation spatial join. In Proc. ACM SIGMOD Symp. on the Management of Data, 1997.
17. S. Leutenegger, J. Edgington, and M. Lopez. STR: a Simple and Efficient Algorithm for Rtree Packing. In Proc. IEEE Intl. Conf. on Data Engineering (ICDE), 1997.
18. M.-L. Lo and C.V. Ravishankar. Spatial Hash-Joins. In Proc. ACM SIG-MOD Symp. on the Management of Data, pages 247-258, 1996.
19. M.-L. Lo and C.V. Ravishankar. The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins. IEEE Transactions on Knowledge and Data Engineering, 10(1), 1998. First published in SIGMOD’94.
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.
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.
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.
23. Oracle 8 Server Concepts, Chap. 19 (The Optimizer). Oracle Technical Documentation.
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.
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.
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.
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.
28. P. Valduriez. Join Indices. ACM Trans. on Database Systems, 12(2):218-246, 1987.
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.