Skip to main content

The combination of spatial access methods and computational geometry in geographic database systems

  • Geometric Algorithms
  • Conference paper
  • First Online:
Advances in Spatial Databases (SSD 1991)

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

Included in the following conference series:

Abstract

Geographic database systems, known as geographic information systems (GISs) particularly among non-computer scientists, are one of the most important applications of the very active research area named spatial database systems. Consequently following the database approach, a GIS has to be seamless, i.e. store the complete area of interest (e.g. the whole world) in one database map. For exhibiting acceptable performance a seamless GIS has to use spatial access methods. Due to the complexity of query and analysis operations on geographic objects, state-of-the-art computational geometry concepts have to be used in implementing these operations. In this paper, we present GIS operations based on the compuational geometry technique plane sweep. Specifically, we show how the two ingredients spatial access methods and computational geometry concepts can be combined for improving the performance of GIS operations. The fruitfulness of this combination is based on the fact that spatial access methods efficiently provide the data at the time when computational geometry algorithms need it for processing. Additionally, this combination avoids page faults and facilitates the parallelization of the algorithms.

This work was supported by grant no. Kr 670/4-3 from the Deutsche Forschungsgemeinschaft (German Research Society) and by the Ministry of Environmental and Urban Planning of Bremen

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. Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. Proc. ACM SIGMOD Int. Conf. on Management of Data, 322–331, 1990

    Google Scholar 

  2. Brinkhoff, T.: Map Overlay of Thematic Maps Supported by Spatial Access Methods. Master thesis (in German), University of Bremen, 1990

    Google Scholar 

  3. Burrough, P.A.: Principles of Geographical Information Systems for Land Resources Assessment. Oxford University Press, 1986

    Google Scholar 

  4. Franklin, W.R.: Cartographic Errors Symtomatic of Underlying Algebra Problems. Proc. Int. Symp. on Spatial Data Handling, Vol. I, 190–208, 1984

    Google Scholar 

  5. Frank, A.U.: Overlay Processing in Spatial Information Systems. Proc. 8th Int. Symp. on Computer-Assisted Cartography (Auto-Carto 8), 16–31, 1987

    Google Scholar 

  6. Franklin, W.R. et al.: Uniform Grids: A Technique for Intersection Detection on Serial and Parallel Machines. Proc. 9th Int. Symp. on Computer-Assisted Cartography (Auto-Carto 9), 100–109, 1989

    Google Scholar 

  7. Freeston, M.: The BANG file: a new kind of grid file. Proc. ACM SIGMOD Int. Conf. on Management of Data, 260–269, 1987

    Google Scholar 

  8. Franklin, W.R., Wu, P.Y.F.: A Polygon Overlay System in Prolog. Proc. 8th Int. Symp. on Computer-Assisted Cartography (Auto-Carto 8), 97–106, 1987

    Google Scholar 

  9. Gonauser, M., Mrva, M. (eds.): Multiprozessor-Systeme: Architektur und Leistungsbewertung. Springer, 1989

    Google Scholar 

  10. Günther, O.: The Design of the Cell Tree: An Object-Oriented Index Structure for Geometric Databases. Proc. IEEE 5th Int. Conf. on Data Engineering, 598–605, 1989

    Google Scholar 

  11. Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. Proc. ACM SIGMOD Int. Conf. on Management of Data, 47–57, 1984

    Google Scholar 

  12. Kriegel, H.-P., Brinkhoff, T., Schneider, R.: An Efficient Map Overlay Algorithm based on Spatial Access Methods and Computational Geometry. Proc. Int. Workshop on DBMS's for geographical applications, Capri, May 16–17, 1991

    Google Scholar 

  13. Kriegel, H.-P., Heep, P., Heep, S., Schiwietz, M., Schneider, R.: An Access Method Based Query Processor for Spatial Database Systems. Proc. Int. Workshop on DBMS's for geographical applications, Capri, May 16–17, 1991

    Google Scholar 

  14. Kriegel, H.-P., Heep, P., Heep, S., Schiwietz, M., Schneider, R.: A Flexible and Extensible Index Manager for Spatial Database Systems. Proc. 2nd Int. Conf. on Database and Expert Systems Applications (DEXA '91), Berlin, August 21–23, 1991

    Google Scholar 

  15. Kriegel, H.-P., Seeger, B.: PLOP-Hashing: A Grid File without Directory. Proc. 4th Int. Conf. on Data Engineering, 369–376, 1988

    Google Scholar 

  16. Kriegel, H.-P., Schneider, R.: The TR*-tree: A New Representation of Polygonal Objects Supporting Spatial Queries and Operations. Submitted for publication, 1991

    Google Scholar 

  17. Kriegel, H.P., Schiwietz, M., Schneider, R., Seeger, B.: Performance Comparison of Point and Spatial Access Methods. Proc. 1st Symp. on the Design of Large Spatial Databases, 1989. In: Lecture Notes in Computer Science 409, Springer, 89–114, 1990

    Google Scholar 

  18. Nievergelt, J., Hinterberger, H., Sevcik, K.C.: The Grid File: An Adaptable, Symmetric Multikey File Structure. ACM Trans. on Database Systems, Vol. 9, No. 1, 38–71, 1984

    Google Scholar 

  19. Nievergelt, J.: 7±2 Criteria for Assessing and Comparing Spatial Data Structures. Proc. 1st Symp. on the Design of Large Spatial Databases, 1989. In: Lecture Notes in Computer Science 409, Springer, 3–28, 1990

    Google Scholar 

  20. Oosterom, P.J.M.: Reactive Data Structures for Geographic Information Systems. PhD-thesis, Department of Computer Science at Leiden University, 1990

    Google Scholar 

  21. Preparata, F.P., Shamos, M.I.: Computational Geometry. Springer, 1988

    Google Scholar 

  22. Samet, H.: The Design and Analysis of Spatial Data Structures. Addison-Wesley, 1989

    Google Scholar 

  23. Siegel, H.J., Hsu, W.T.: Interconnection Networks. In: Milutinovic (ed.): Computer Architecture: Concepts and Systems. North-Holland, 225–264, 1987

    Google Scholar 

  24. Seeger, B., Kriegel, H.-P.: Techniques for Design and Implementation of Efficient Spatial Access Methods. Proc. 14th Int. Conf. on Very Large Data Bases, 360–371, 1988

    Google Scholar 

  25. Seeger, B., Kriegel, H.-P.: The Buddy-Tree: An Efficient and Robust Access Method for Spatial Database Systems. Proc. 16th Int. Conf. on Very Large Data Bases, 590–601, 1990

    Google Scholar 

  26. Tilove, R.B.: Set Membership Classification: A Unified Approach To Geometric Intersection Problems. IEEE Trans. on Computers, Vol. C-29, No. 10, 874–883, 1980

    Google Scholar 

  27. Tomlin, C.D.: Geographic Information Systems and Cartographic Modeling. Prentice-Hall, 1990

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Oliver Günther Hans-Jörg Schek

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kriegel, HP., Brinkhoff, T., Schneider, R. (1991). The combination of spatial access methods and computational geometry in geographic database systems. In: Günther, O., Schek, HJ. (eds) Advances in Spatial Databases. SSD 1991. Lecture Notes in Computer Science, vol 525. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54414-3_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-54414-3_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47615-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics