An integrated platform for the evaluation of spatial query processing strategies

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

Volumn 1460, Issue , 1998, Pages 757-766

  Gurret, Christophe ^a   Rigaux, Philippe ^a  

^a CEDRIC CNAM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; DATABASE SYSTEMS; EXPERT SYSTEMS;

INTEGRATED PLATFORM; MULTIDIMENSIONAL DATABASE; PROCESSING STRATEGIES; SPATIAL INDICES; SPATIAL JOIN; SPATIAL QUERY PROCESSING;

QUERY PROCESSING;

EID: 84949218782     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054531     Document Type: Conference Paper

References (23)

1. G. Graefe. Query evaluation techniques for large databases. ACM Computing Surveys, 25(2):73-170, 1993.
2. R.H. Güting. An Introduction to Spatial Database Systems. The VLDB Journal, 3(4), 1994.
3. M. Scholl and A. Voisard, editors. Proc. Intl. Syrup. on Large Spatial Databases (SSD). LNCS No. 1262. Springer-Verlag, 1997.
4. J. Orenstein and F. Manola. PROBE: Spatial Data Modeling and Query Processing in an Image Database Application. IEEE Transactions on Software Engineering, 14(5):611-628, 1988.
5. J. A. Orenstein. Redundancy in Spatial Databases. In Proc. A CM SIGMOD Syrup. on the Management of Data, 1989.
6. T. Brinkhoff, H.-P. Kriegel, and B. Seeger. Efficient Processing of Spatial Joins Using R-Trees. In Proc. A CM SIGMOD Syrup. on the Management of Data, 1993.
7. M.-L. Lo and C.V. Ravishankar. Spatial Hash-Joins. In Proc. ACM SIGMOD Syrup. on the Management of Data, pages 247-258, 1996.
8. J.M. Patel and D. J. DeWitt. Partition Based Spatial-Merge Join. In Proc. ACM SIGMOD Syrup. on the Management of Data, pages 259-270, 1996.
9. J. Nievergeit, H. Hinterger, and K.C. Sevcik. The Grid File: An Adaptable Symmetric Multikey File Structure. A CM Transactions on Database Systems, 9(1):38-71, 1984.
10. A. Guttman. R-trees: A Dynamic Index Structure for Spatial Searching. In Proc. ACM SIGMOD Intl. Syrup. on the Management of Data, pages 45-57, 1984.
11. N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger. The R*tree: An Efficient and Robust Access Method for Points and Rectangles. In Proe. A CM SIGMOD Intl. Syrup. on the Management of Data, pages 322-331, 1990.
12. 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.
13. O. Günther. Efficient Computation of Spatial Joins. In Proc. IEEE Intl. Conf. on Data Engineering, pages 50-59, 1993.
14. L. Becker, K. Hinrichs, and U. Finke. A New Algorithm for ComPuting Joins with Grid Files. In Proc. IEEE Intl. Conf. on Data Engineering, 1993.
15. 2. Communication of the ACM, 19-.
16. E.G. Hoel and H. Samet. Benchmarking Spatial Join Operations with Spatial Output. In Proc. of Intl. Conf. on Very Large Data Bases, 1995.
17. Y.-W. Huang, N. Jing, and E.A. Rudensteiner. Spatial Joins Using R-trees: Breadth-first Traversal with Global Optimizations. In Proc. of Intl. Conf. on Very Large Data Bases, 1997.
18. M.-L. Lo and C.V. Ravishankar. Spatial Joins Using Seeded-Trees. In Proc. ACM SIGMOD Syrup. on the Management of Data, 1994.
19. N. Rossopoulos and D. Leifker. Direct Spatial Search on Pictorial Databases Using Packed R-Trees. In Proc. A CM SIGMOD Syrup. on the Management of Data, 1985.
20. S. Leutenegger, J. Edglngton, and M. Lopez. STR: A Simple and Efficient Algorithm for R-Tree. In Proc. IEEE Intl. Conf. on Data Engineering (ICDE), pages 497-507, 1996.
21. O. Gunther, V. Oria, P. Picouet, J.-M. Saglio, and M. Scholl. Benchmarking Spatial Joins A La Carte. In Intl. Conf. on Scientific and Statistical Databases (SSDBM'98), 1998.
22. D. Kerr, A.N. Papadopoulos, and Y. Manolopoulos. The BASIS System: a Benchmarking Approach for Spatial Index Structures. In Submitted to publication, 1998.
23. US Bureau of The Census. Tiger Line files, Technical Documentation, 1995.