Advertisement

Spatial queries and data models

  • Leila De Floriani
  • Paola Marzano
  • Enrico Puppo
Query Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 716)

Abstract

We present a unified framework for classifying and answering spatial queries relevant to a Geographic Information System. We classify spatial queries into topological, set-theoretic, and metric queries, on the basis of the kind of relationships between the query object and entities in the search space involved. For answering such queries, we propose an approach that combines an object-based description of spatial entities, provided by a topological model, with a partition of the space embedding such entities, given by a spatial index. In particular, we propose a new unified topological model, called the Plane Euclidean Graph (PEG), that is capable of describing point, line, and region data, and that incorporates relational operators on such entities. We briefly describe major techniques, rooted in computational geometry, for solving interference queries and overlays on such a data model. Finally, we describe the use of a superimposed spatial index for speeding up searches and answering queries involving distances.

Keywords

Topological Model Topological Relation Spatial Index Query Object Spatial Query 
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. [1]
    Bentley, J.L, Ottmann, T.A., “Algorithms for reporting and counting geometric intersections”, IEEE Transactions on Computers, 28, pp. 643–647, 1979.Google Scholar
  2. [2]
    Brunet, P., Navazo, I., “Solid representation and operation using extended octrees”, ACM Transaction on Graphics, 8, 1989.Google Scholar
  3. [3]
    Bruzzone, E., De Floriani, L., Pellegrinelli, M., “A hierarchical spatial index for cell complexes”, in Proceedings 3rd International Symposium on Large Spatial Data Bases, Singapore, June 1993, (in print).Google Scholar
  4. [4]
    Chazelle, B., Edelsbrunner, H., “Optimal solution for intersecting line segments”, in Proceedings 29th IEEE Symp. on Foundation of Computer Science, October 1988.Google Scholar
  5. [5]
    Dobkin, D.P., Laszlo, M.J., “Primitives for the manipulation of threedimensional subdivisions”, Algorithmica, 5(4), pp.3–32, 1989.Google Scholar
  6. [6]
    Egenhofer, M., Frank, A.U., Jackson, J.P., “A topological model for spatial databases”, Lecture Notes in Computer Science, N.409, pp.271–286, 1989.Google Scholar
  7. [7]
    Egenhofer, M., “A formal definition of binary topological relationships”, Lecture Notes in Computer Science, N.367, pp.457–473, 1989.Google Scholar
  8. [8]
    Egenhofer, M., Herring, J., “A mathematical framework for the definition of topological relationships”, in Proceedings 4th International Symposium on Spatial Data Handling, pp.803–813, Zurich, Switzerland, July 1990.Google Scholar
  9. [9]
    Egenhofer, M., Franzosa, R., “Point-set topological spatial relations”, International Journal of Geographical Information Systems, 5(2), pp.161–174, 1991.Google Scholar
  10. [10]
    Frank, A., Kuhn, W., “Cell graph: a provable correct method for the storage of geometry”, Proceedings 2nd International symposium on Spatial data Handling, Seattle, WA, 1986.Google Scholar
  11. [11]
    Franklin, W.R., et al., “Uniform grids: a technique for intersection detection on serial and parallel machines”, in Proceedings Auto Carlo 9, Baltimore, MD, April 2–7, 1989, pp. 100–109.Google Scholar
  12. [12]
    Gold, C.M., “The meaning of “neighbour””, Lecture Notes in Computer Science, N.639, Springer-Verlag, 1992, pp. 220–235.Google Scholar
  13. [13]
    Guibas, L., Stolfi, J., “Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams”, ACM Transactions on Graphics, 4(2), pp.75–123, 1985.Google Scholar
  14. [14]
    Günther, O., Efficient Structures for Geometric Data Management (LNCS 337), Spriger-Verlag, 1987.Google Scholar
  15. [15]
    Herring, J., “TIGRIS: topologically integrated GIS”, Proceedings Autocarto 8, ASPRS/ACSM, Baltimore, MD, pp.282–291, March 1987.Google Scholar
  16. [16]
    Herring, J., Egenhofer, M.J., Frank, A.U., “Using category theory to model GIS applications”, in Proceedings 4th International Symposium on Spatial Data Handling, pp.820–829, Zurich, Switzerland, July 1990.Google Scholar
  17. [17]
    Hoel, E.G., Samet, H., “Efficient processing of spatial queries in line segment database”, Lecture Notes in Computer Science, N.525, Springer-Verlag, 1991.Google Scholar
  18. [18]
    Kainz, W., “Spatial relationships — Topology versus order”, in Proceedings 4th International Symposium on Spatial Data Handling, pp.814–819, Zurich, Switzerland, July 1990.Google Scholar
  19. [19]
    Kirkpatrick, D.G., “Optimal search in planar subdivision”, SIAM Journal of Computing, 12(1), pp. 28–33, 1983.Google Scholar
  20. [20]
    Lee, D.T., Preparata, F.P., “Location of a point in a planar subdivision and its applications”, SIAM Journal on Computing, 6(3), pp. 594–606, 1977.Google Scholar
  21. [21]
    M. Mäntylä, An Introduction to Solid Modeling, Computer Science Press, Rockville, MD, 1987.Google Scholar
  22. [22]
    Molenaar, M., “Single valued vector maps — a concept in GIS”, Geo-Informationssysteme, Vol.2, No.1, 1989.Google Scholar
  23. [23]
    Pigot, S., “A topological model for a 3D spatial information system”, Proceedings 5th International Symposium on Spatial Data Handling, Charleston, SC, August 3–7, 1992.Google Scholar
  24. [24]
    Preparata, F.P., Shamos, M.I., Computational Geometry: an Introduction, Springer-Verlag, 1985.Google Scholar
  25. [25]
    Requicha, A.A.G., Voelcker, H.B., “Solid modeling: a historical summary and contemporary assessment”, IEEE Computer Graphics and Applications, 2, 2, pp.9–24, 1982.Google Scholar
  26. [26]
    Rossignac, J.R., O'Connor, M.A., “SGC: a dimensional-independent model for pointsets with internal structures and incomplete boundaries”, Geometric Modeling for Product Engineering, Wosny, M.J., Turner, J.U., and Preiss, K., Eds., Elsevier Science Publishers B.V. (North Holland), pp. 145–180, 1990.Google Scholar
  27. [27]
    Rossignac, J.R., “Through the cracks of the solid modeling milestone”, Eurographics 91 Statt of the Art Report on Solid Modeling, pp. 23–109, 1991.Google Scholar
  28. [28]
    H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley, Reading, MA, 1990.Google Scholar
  29. [29]
    Smith, T.R., Park, K.K., “Algebraic approach to spatial reasoning”, International Journal of Geographical Information Systems, 6(3), pp.177–192, 1992.Google Scholar
  30. [30]
    Whitney, H., Geometric Integration Theory, Princeton University Press, 1957.Google Scholar
  31. [31]
    Woo, T.C., “A combinatorial analysis of boundary data structure schemata”, IEEE Computer Graphics and Applications, 5, 3, pp. 19–27, 1985.Google Scholar
  32. [32]
    Worboys, M.F., Hearnshaw, H.M., Maguire, D.J., “Object-oriented data modelling for spatial databases”, International Journal of Geographical Information Systems, 4(4), pp.369–383, 1990.Google Scholar
  33. [33]
    Worboys, M.F., “A generic model for planar geographic objects”, International Journal of Geographical Information Systems, 6(5), pp.353–372, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Leila De Floriani
    • 1
  • Paola Marzano
    • 1
  • Enrico Puppo
    • 2
  1. 1.Dipartimento di Informatica e Scienze dell'InformazioneUniversità di GenovaGenovaItaly
  2. 2.Istituto per la Matematica ApplicataConsiglio Nazionale delle RicercheGenovaItaly

Personalised recommendations