Skip to main content
SpringerLink
Log in
Book cover

International Conference on Spatial Information Theory

COSIT 1995: Spatial Information Theory A Theoretical Basis for GIS pp 537–551Cite as

Range queries involving spatial relations: A performance analysis

  • Conference paper
  • First Online:

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

Abstract

Spatial relations are becoming an important aspect of spatial access methods because of the increasing interest on qualitative spatial information processing. In this paper we show how queries involving spatial relations can be transformed to range queries and implemented in existing DBMSs. We provide a performance analysis of B- and R- tree indexing methods to support such queries and we evaluate the analytical formulas using experimental results. The proposed analytical models for the expected retrieval cost of spatial relations are proved to be good guidelines for a spatial query optimiser.

Yannis Theodoridis was partially supported by the Department of Research and Technology of Greece (PENED'91).

Dimitris Papadias was partially supported by NSF-IRI 9221276. He is currently with the National Center for Geographic Information and Analysis, University of Maine, Orono ME 04469-5711.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Batory, D.S., “B+ Trees and Indexed Sequential Files: A Performance Comparison”, In the Proceedings of ACM SIGMOD Conference, 1981.

    Google Scholar 

  2. Beckmann, N., Kriegel, H.P. Schneider, R., Seeger, B., “The R*-tree: an Efficient and Robust Access Method for Points and Rectangles”, In the Proceedings of ACM SIGMOD Conference, 1990.

    Google Scholar 

  3. Clementini, E., Sharma, J., Egenhofer, M., “Modeling Topological Spatial Relations: Strategies for Query Processing”, International Journal of Computer and Graphics, 18(6), 815–822.

    Google Scholar 

  4. Comer, D., “The Ubiquitous B-Tree”, ACM Computing Surveys, Vol. 11(2), pp. 121–137, 1979.

    Google Scholar 

  5. Egenhofer, M., “Reasoning about Binary Topological Relations”, In the Proceedings of the Second Symposium on the Design and Implementation of Large Spatial Databases (SSD), Springer Verlag LNCS, 1991.

    Google Scholar 

  6. Egenhofer, M., Franzosa R., “Point-Set Topological Spatial Relations”, International Journal of Geographic Information Systems, Vol 5(2), pp. 160–174, 1991.

    Google Scholar 

  7. Faloutsos, C., Sellis, T., Roussopoulos, N., “Analysis of Object Oriented Spatial Access Methods”, In the Proceedings of ACM SIGMOD Conference, 1987.

    Google Scholar 

  8. Faloutsos, C., Kamel, I., “Beyond Uniformity and Independence: Analysis of R-trees Using the Concept of Fractal Dimension”, In the Proceedings of the 13th ACM PODS Symposium, 1994.

    Google Scholar 

  9. Frank, A.U., “Qualitative Spatial Reasoning about Distances and Directions in Geographic Space”, Journal of Visual Languages and Computing, Vol. 3, pp. 343–371, 1992.

    Google Scholar 

  10. Guttman, A., “R-trees: A Dynamic Index Structure for Spatial Searching”, In the Proceedings of ACM SIGMOD Conference, 1984.

    Google Scholar 

  11. Knuth, D., “The Art of Computer Programming, vol.3: Sorting and Searching”, Addison-Wesley, 1973.

    Google Scholar 

  12. Mark, D., Egenhofer, M., “Calibrating the Meaning of Spatial Predicates from Natural Language: Line Region Relations”, In the Proceedings of the 6th International Symposium on Spatial Data Handling (SDH), Taylor Francis, 1994.

    Google Scholar 

  13. Nievergelt, J., Hinterberger, H., Sevcik, K.C., “The Grid File: An Adaptable, Symmetric Multikey file Structure”, ACM Transactions on Database Systems, Vol 9(1), pp. 38–71, 1984.

    Google Scholar 

  14. Pagel, B., Six, H., Toben, H., Widmayer, P., “Towards an Analysis of Range Query Performance”, In the Proceedings of the 12th ACM PODS Symposium, 1993.

    Google Scholar 

  15. Papadias, D., Frank, A.U., Koubarakis, M., “Constraint-Based Reasoning in Geographic Databases: The Case of Symbolic Arrays”, In the Proceedings of the 2nd ICLP Workshop on Deductive Databases, 1994.

    Google Scholar 

  16. Papadias, D., Sellis, T., “Qualitative Representation of Spatial Knowledge in two-dimensional Space”, Very Large Data Bases Journal, Special Issue on Spatial Databases, Vol 3(4), pp. 479–516, 1994.

    Google Scholar 

  17. Papadias, D., Theodoridis, Y., Sellis, T., “The Retrieval of Direction Relations Using R-trees”, In the Proceedings of the 5th Conference on Database and Expert Systems Applications (DEXA), Springer Verlag LNCS, 1994.

    Google Scholar 

  18. Papadias, D., Sellis, T., “A Pictorial Query-by-Example Language”, Journal of Visual Languages and Computing, Special Issue on Visual Query Systems, 6(1), pp 53–72, 1995.

    Google Scholar 

  19. Papadias, D., Theodoridis, Y., Sellis, T., Egenhofer, M., “Topological Relations in the World of Minimum Bounding Rectangles: a Study with R-trees”, In the Proceedings of ACM SIGMOD Conference, 1995.

    Google Scholar 

  20. Robinson, J.T., “The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes”, In the Proceedings of ACM SIGMOD Conference, 1981.

    Google Scholar 

  21. Roussopoulos, N., Kelley, F., Vincent, F., “Nearest Neighbor Queries”, In the Proceedings of ACM SIGMOD Conference, 1995.

    Google Scholar 

  22. Sellis, T., Roussopoulos, N., Faloutsos, C., “The R+-tree: A Dynamic Index for Multi-Dimensional Objects”, In the Proceedings of the 13th Very Large Data Bases Conference, 1987.

    Google Scholar 

  23. Stonebraker, M., Rowe, L., “The Design of Postgres”, In the Proceedings of ACM SIGMOD Conference, 1986.

    Google Scholar 

  24. Sistla, P., Yu, C., Haddad, R., “Reasoning about Spatial Relationships in Picture Retrieval Systems”, In the Proceedings of the 20th Very Large Data Bases Conference, 1994.

    Google Scholar 

  25. Topaloglou, T., “Spatial Databases with Partial Information: Representation and Reasoning”, Forthcoming Ph.D Thesis, University of Toronto, Canada, 1995.

    Google Scholar 

  26. Theodoridis, Y., Papadias, D., Stefanakis, E., “Supporting Direction Relations in Spatial Database Systems”, Technical Report, KDBSLAB-TR-95-02, National Technical University of Athens, Athens, Greece, 1995.

    Google Scholar 

  27. Theodoridis, Y., Sellis, T., “Indexing Point and Non-point Spatial Data: A Performance Analysis”, Technical Report, KDBSLAB-TR-95-03, National Technical University of Athens, Athens, Greece, 1995.

    Google Scholar 

  28. Yao, A.C., “On Random 2–3 Trees”, Acta Informatica, Vol. 9(2), pp. 159–168, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Electrical and Computer Engineering, National Technical University of Athens, 15773, Greece

    Yannis Theodoridis

  2. Dept. of Computer Science and Engineering, University of California, 92093-0114, San Diego, CA, USA

    Dimitris Papadias

Authors
  1. Yannis Theodoridis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dimitris Papadias
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrew U. Frank Werner Kuhn

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Theodoridis, Y., Papadias, D. (1995). Range queries involving spatial relations: A performance analysis. In: Frank, A.U., Kuhn, W. (eds) Spatial Information Theory A Theoretical Basis for GIS. COSIT 1995. Lecture Notes in Computer Science, vol 988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60392-1_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-60392-1_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60392-4

  • Online ISBN: 978-3-540-45519-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation