Skip to main content

An integrated platform for the evaluation of spatial query processing strategies

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 1998)

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

Included in the following conference series:

Abstract

We present in this paper a platform which integrates the necessary tools for the performance evaluation of various query processing strategies in multidimensional databases, and proposes a simple interface for the specification of spatial benchmarks.

In its current setting, our platform is focused on 2-dimensional operations: several kinds of spatial indices and spatial join algorithms have been implemented and their performance compared. We give these first results and discuss their relevancy.

Work partially supported by the ESPRIT TMR Chorochronos network.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  Google Scholar 

  2. R.H. Güting. An Introduction to Spatial Database Systems. The VLDB Journal, 3(4), 1994.

    Google Scholar 

  3. M. Scholl and A. Voisard, editors. Proc. Intl. Symp. on Large Spatial Databases (SSD). LNCS No. 1262. Springer-Verlag, 1997.

    Google Scholar 

  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):G11–G28, 1988.

    Article  Google Scholar 

  5. J. A. Orenstein. Redundancy in Spatial Databases. In Proc. ACM SIGMOD Symp. on the Management of Data, 1989.

    Google Scholar 

  6. 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.

    Google Scholar 

  7. 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 

  8. 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 

  9. J. Nievergelt, 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.

    Article  Google Scholar 

  10. 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 

  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 Proc. ACM SIGMOD Intl. Symp. on the Management of Data, pages 322–331, 1990.

    Google Scholar 

  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.

    Google Scholar 

  13. O. Günther. Efficient Computation of Spatial Joins. In Proc. IEEE Intl. Conf. on Data Engineering, pages 50–59, 1993.

    Google Scholar 

  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.

    Google Scholar 

  15. M. Scholl, G. Grangeret, and X. Rehse. Point and window queries with linear spatial indices: An evaluation with O2. Communication of the ACM, 19-.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  18. M.-L. Lo and C.V. Ravishankar. Spatial Joins Using Seeded-Trees. In Proc. ACM SIGMOD Symp. on the Management of Data, 1994.

    Google Scholar 

  19. N. Rossopoulos and D. Leifker. Direct Spatial Search on Pictorial Databases Using Packed R-Trees. In Proc. A CM SIGMOD Symp. on the Management of Data, 1985.

    Google Scholar 

  20. S. Leutenegger, J. Edgington, 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.

    Google Scholar 

  21. O. Gunther, V. Oria, P. Picouet, J.-M. Saglio, and M. Scholl. Benchmarking Spatial Joins á La Carte. In Intl. Conf. on Scientific and Statistical Databases (SSDBM'98), 1998.

    Google Scholar 

  22. D. Kerr, A.N. Papadopoulos, and Y. Manolopoulos. The BASIS System: a Benchmarking Approach for Spatial Index Structures. In Submitted to publication, 1998.

    Google Scholar 

  23. US Bureau of The Census. Tiger Line files, Technical Documentation, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Gerald Quirchmayr Erich Schweighofer Trevor J.M. Bench-Capon

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gurret, C., Rigaux, P. (1998). An integrated platform for the evaluation of spatial query processing strategies. In: Quirchmayr, G., Schweighofer, E., Bench-Capon, T.J. (eds) Database and Expert Systems Applications. DEXA 1998. Lecture Notes in Computer Science, vol 1460. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054531

Download citation

  • DOI: https://doi.org/10.1007/BFb0054531

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64950-2

  • Online ISBN: 978-3-540-68060-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics