Skip to main content
SpringerLink
Log in

Spatial access structures for geometric databases

  • Geometric Algorithms
  • Chapter
  • First Online:
Data structures and efficient algorithms

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

Abstract

This paper surveys basic concepts of spatial access structures for geometric databases. We discuss the isolated plausibility arguments on which spatial access structure design decisions are traditionally based whenever efficiency is the primary goal, and we propose a more integrated view. This helps to explain phenomena that have been observed in experiments, and it lays the foundation for tailoring spatial access structures to the particular application requirements.

This work has been supported by the Deutsche Forschungsgemeinschaft DFG, grants Si 374/1 and Wi 810/2

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Abel, D.J., D.M. Mark (1990): A comparative analysis of some two-dimensional orderings; International Journal of Geographical Information Systems, Vol. 4, No. 1, 21–31

    Google Scholar 

  • Becker, B., P. Franciosa, S. Gschwind, T. Ohler, G. Thiemt, P. Widmayer (1992): Enclosing many boxes by an optimal pair of boxes; to appear in Proceedings of the 9th Symposium on Theoretical Aspects of Computer Science, Paris, 1992

    Google Scholar 

  • Beckmann, N., H.-P. Kriegel, R. Schneider, B. Seeger (1990): The R*-tree: an efficient and robust access method for points and rectangles; Proc. ACM SIGMOD International Conference on the Management of Data, Atlantic City, New Jersey, 322–331

    Google Scholar 

  • Blankenagel, G. (1991): Intervall-Indexstrukturen und externe Algorithmen für Nicht-Standard-Datenbanksysteme, Doctoral Dissertation, FernUniversität Hagen

    Google Scholar 

  • Comer, D. (1979): The ubiquitous B-tree; ACM Computing Surveys, Vol. 11, No. 2, 121–138

    Article  Google Scholar 

  • Crain, I.K. (1990): Extremely large spatial information systems: a quantitative perspective; Proc. 4th International Symposium on Spatial Data Handling, Zürich, 632–641

    Google Scholar 

  • Devroye L. (1986): Lecture notes on bucket algorithms; Birkhäuser, Boston

    Google Scholar 

  • Enbody, R.J., H.C. Du (1988): Dynamic hashing schemes; ACM Computing Surveys, Vol. 20, No. 2, 85–113

    Article  Google Scholar 

  • Faloutsos, C. (1985): Multiattribute hashing using Gray codes; Proc. ACM SIGMOD International Conference on the Management of Data, Washington D.C., 227–238

    Google Scholar 

  • Faloutsos, C. (1988): Gray codes for partial match and range queries; IEEE Transactions on Software Engineering, Vol. 14, 1381–1393

    Article  Google Scholar 

  • Faloutsos, C., S. Roseman (1989): Fractals for secondary key retrieval; Proc. 8th ACM SIGACT/SIGMOD Symposium on Principles of Database Systems, 247–252

    Google Scholar 

  • Flajolet P., C. Puech (1986): Partial match retrieval of multidimensional data; Journal of the ACM, Vol. 33, No. 2, 371–407

    Article  Google Scholar 

  • Freeston, M.W. (1987): The BANG file: a new kind of grid file; Proc. ACM SIGMOD International Conference on the Management of Data, San Francisco, 260–269

    Google Scholar 

  • Freeston, M.W. (1989a): Advances in the design of the BANG file; Proc. 3rd International Conference on Foundations of Data Organization and Algorithms, Paris, Lecture Notes in Computer Science, Vol. 367, Springer, Berlin, 322–338

    Google Scholar 

  • Freeston, M.W. (1989b): A well-behaved file structure for the storage of spatial objects; Symposium on the Design and Implementation of Large Spatial Databases, Santa Barbara, Lecture Notes in Computer Science, Vol. 409, Springer, Berlin, 287–300

    Google Scholar 

  • Greene, D. (1989): An implementation and performance analysis of spatial data access methods; Proc. 5th International Conference on Data Engineering, Los Angeles, 606–615

    Google Scholar 

  • Günther, O. (1988): Efficient structures for geometric data management; Lecture Notes in Computer Science, Vol. 337, Springer, Berlin

    Google Scholar 

  • Günther, O., A. Buchmann (1990): Research issues in spatial databases; IEEE CS Bulletin on Data Engineering, Vol. 13, No. 4, 35–42

    Google Scholar 

  • Guttman, A. (1984): R-trees: a dynamic index structure for spatial searching; Proc. ACM SIGMOD International Conference on the Management of Data, Boston, 47–57

    Google Scholar 

  • Harding, E.F., D.G. Kendall (1974): Stochastic Geometry; Wiley, New York

    Google Scholar 

  • Henrich, A. (1990): Der LSD-Baum: eine mehrdimensionale Zugriffsstruktur und ihre Einsatzmöglichkeiten in Datenbanksystemen; Doctoral Dissertation, FernUniversität Hagen

    Google Scholar 

  • Henrich, A., H.-W. Six, P. Widmayer (1989): The LSD-tree: Spatial access to multidimensional point-and non-point objects; 15th International Conference on Very Large Data Bases, Amsterdam, 45–53

    Google Scholar 

  • Hinrichs, K.H. (1985): The grid file system: implementation and case studies of applications; Doctoral Dissertation, ETH Zürich.

    Google Scholar 

  • Hutflesz, A., H.-W. Six, P. Widmayer (1988): Globally order preserving multidimensional linear hashing; Proc. 4th International Conference on Data Engineering, Los Angeles, 572–579

    Google Scholar 

  • Hutflesz, A., H.-W. Six, P. Widmayer (1990): The R-file: An efficient access structure for proximity queries; Proc. 6th International Conference on Data Engineering, Los Angeles, 372–379

    Google Scholar 

  • Hutflesz, A., P. Widmayer, C. Zimmermann (1991): Global order makes spatial access faster; International Workshop on Data Base Management Systems for Geographical Applications, Springer

    Google Scholar 

  • Jagadish, H.V. (1990a): Spatial search with polyhedra; Proc. 6th International Conference on Data Engineering, Los Angeles, 311–319

    Google Scholar 

  • Jagadish, H.V. (1990b): Linear clustering of objects with multiple attributes; Proc. ACM SIGMOD International Conference on the Management of Data, Atlantic City, New Jersey, 332–342

    Google Scholar 

  • Kriegel, H.-P., B. Seeger (1986): Multidimensional order preserving linear hashing with partial expansions; Proc. International Conference on Database Theory, Lecture Notes in Computer Science, Vol. 243, Springer, Berlin, 203–220

    Google Scholar 

  • Kriegel, H.-P., B. Seeger (1989): Multidimensional quantile hashing is very efficient for non-uniform distributions; Information Sciences, Vol. 48, 99–117

    Article  Google Scholar 

  • Manola, F., J.A. Orenstein (1986): Toward a general spatial data model for an object-oriented DBMS; Proc. 12th International Conference on Very Large Data Bases, Kyoto, 328–335

    Google Scholar 

  • Matheron G. (1975): Random sets and integral geometry; Wiley, New York

    Google Scholar 

  • Mecke, J., R.G. Schneider, D. Stoyan, W.R.R. Weil (1990): Stochastische Geometrie; DMV-Seminar Vol. 16, Birkhäuser, Basel

    Google Scholar 

  • Nievergelt, J. (1989): 7±2 criteria for assessing and comparing spatial data structures; Symposium on the Design and Implementation of Large Spatial Databases, Santa Barbara, Lecture Notes in Computer Science, Vol. 409, Springer, Berlin, 3–28

    Google Scholar 

  • Nievergelt, J., H. Hinterberger, K.C. Sevcik (1984): The grid file: an adaptable, symmetric multikey file structure; ACM Transactions on Database Systems, Vol. 9, No. 1, 38–71

    Article  Google Scholar 

  • Ooi, B.C. (1987): A data structure for geographic database; GI-Fachtagung Datenbanksysteme für Büro, Technik und Wissenschaft, Informatik-Fachberichte, Vol. 136, Springer, Berlin, 247–258

    Google Scholar 

  • Ooi, B.C. (1990): Efficient query processing in geographic information systems, Lecture Notes in Computer Science, Vol. 471, Springer, Berlin

    Google Scholar 

  • Ooi, B.C., R. Sacks-Davis, K.J. McDonell (1989): Extending a DBMS for geographic applications; Proc. 5th International Conference on Data Engineering, Los Angeles, 590–597

    Google Scholar 

  • Orenstein, J.A. (1989): Redundancy in spatial databases; Proc. ACM SIGMOD International Conference on the Management of Data, Portland, 294–305

    Google Scholar 

  • Orenstein, J.A. (1990): A comparison of spatial query processing techniques for native and parameter spaces; Proc. ACM SIGMOD International Conference on the Management of Data, Atlantic City, New Jersey, 343–352

    Google Scholar 

  • Orenstein, J.A., T.H. Merrett (1984): A class of data structures for associative searching; Proc. 3rd ACM SIGACT/SIGMOD Symposium on Principles of Database Systems, Waterloo, 181–190

    Google Scholar 

  • Otoo, E.J. (1986): Balanced multidimensional extendible hash tree; Proc. 5th ACM SIGACT-SIGMOD International Symposium on Principles of Database Systems, Cambridge, Massachusetts, 100–113

    Google Scholar 

  • Ouksel, M., P. Scheuermann (1983): Storage mappings for multidimensional linear dynamic hashing; Proc. 2nd ACM SIGACT/SIGMOD Symposium on Principles of Database Systems, 90–105

    Google Scholar 

  • Regnier, M. (1985): Analysis of grid file algorithms; BIT Vol. 25, 335–357

    Google Scholar 

  • Robinson, J.T. (1981): The K-D-B-tree: a search structure for large multidimensional dynamic indexes; Proc. ACM SIGMOD International Conference on the Management of Data, Ann Arbor, 10–18

    Google Scholar 

  • Samet, H. (1990a): The design and analysis of spatial data structures; Addison-Wesley, Reading

    Google Scholar 

  • Samet, H. (1990b): Applications of spatial data structures; Addison-Wesley, Reading

    Google Scholar 

  • Santaló, L.A. (1976): Integral geometry and geometric probability; Addison-Wesley, Reading

    Google Scholar 

  • Seeger, B. (1989): Entwurf und Implementierung mehrdimensionaler Zugriffsstrukturen; Doctoral Dissertation, Universität Bremen

    Google Scholar 

  • Seeger, B., H.-P. Kriegel (1988): Techniques for design and implementation of efficient spatial access methods; Proc. 14th International Conference on Very Large Data Bases, Los Angeles, 360–371

    Google Scholar 

  • Seeger, B., H.-P. Kriegel (1990): The buddy-tree: an efficient and robust access method for spatial data base systems; Proc. 16th International Conference on Very Large Data Bases, Brisbane, 590–601

    Google Scholar 

  • Shaffer, C.A., H. Samet, R.C. Nelson (1990): QUILT: a geographic information system based on quadtrees; International Journal of Geographical Information Systems, Vol. 4, No. 2, 103–131

    Google Scholar 

  • Six H.-W., P. Widmayer (1986): Hintergrundspeicherstrukturen für ausgedehnte Objekte; 16. Jahrestagung der Gesellschaft für Informatik, Berlin, Informatik-Fachberichte, Vol. 126, Springer, Berlin, 538–552

    Google Scholar 

  • Six H.-W., P. Widmayer (1988): Spatial searching in geometric databases; Proc. 4th International Conference on Data Engineering, Los Angeles, 496–503

    Google Scholar 

  • Stoyan, D., W.S. Kendall, J. Mecke (1987): Stochastic geometry and its applications; Wiley, New York, 1987.

    Google Scholar 

  • Tilove, R.B. (1980): Set membership classification: A unified approach to geometric intersection problems; IEEE Transactions on Computers, C-29, 874–883

    Google Scholar 

  • Tropf, H., H. Herzog (1981): Multidimensional range search in dynamically balanced trees; Angewandte Informatik, Vol. 2, 71–77

    Google Scholar 

  • van Oosterom, P. (1990): Reactive data structures for geographic information systems; Doctoral Dissertation (Proefschrift), Rijksuniversiteit Leiden

    Google Scholar 

  • Wang, J.-H., T.-S. Yuen, D.H.-C. Du (1987): On multiple random access and physical data placement in dynamic files; IEEE Transactions on Software Engineering, Vol. 13, No. 8, 977–987

    Google Scholar 

  • Weikum, G., B. Neumann, H.-B. Paul (1987): Konzeption und Realisierung einer mengenorientierten Seitenschnittstelle zum effizienten Zugriff auf komplexe Objekte; GI-Fachtagung Datenbanksysteme für Büro, Technik und Wissenschaft, Informatik-Fachberichte, Vol. 136, Springer, Berlin, 212–230

    Google Scholar 

  • Widmayer, P. (1991): Datenstrukturen für Geodatenbanken; in: Entwicklungstendenzen bei Datenbank-Systemen, ed. G. Vossen, K.-U. Witt, Oldenbourg, München, 317–361

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Praktische Informatik III, FernUniversität, Postfach 940, D-W 5800, Hagen

    Hans-Werner Six

  2. Institut für Informatik, Albert-Ludwigs-Universität, Rheinstr. 10-12, D-W 7800, Freiburg

    Peter Widmayer

Authors
  1. Hans-Werner Six
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Widmayer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Monien Th. Ottmann

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Six, HW., Widmayer, P. (1992). Spatial access structures for geometric databases. In: Monien, B., Ottmann, T. (eds) Data structures and efficient algorithms. Lecture Notes in Computer Science, vol 594. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55488-2_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-55488-2_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47103-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation