[go: up one dir, main page]

Skip to main content

A storage manager for the development of spatial data structures

A performance analysis

  • Conference paper
  • First Online:
IGIS '94: Geographic Information Systems (IGIS 1994)

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

  • 149 Accesses

Abstract

Traditional approaches to spatial and geometrical data management are based on mappings of spatial objects to individual disk pages. However, modern operating-system and hardware technologies allow variable-sized and large I/O operations to be handled almost as efficiently as fixed-sized individual block operations, and, based on this technology, our DASDBS Storage Manager implements a nested-relational storage model supporting arbitrary-sized objects. This paper describes our experiments in exploiting such larger storage clusters for the management of spatial data and its indexing.

Our experiments show the impact of the new storage manager technology on the I/O behaviour of spatial data structures. We show that performance even of very simple spatial data managers can be significantly increased. Our results lead to a new I/O cost model for storage managers, and this can be used to provide new design criteria for spatial data structures.

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.

Similar content being viewed by others

References

  1. Gisbert Dröge and Hans-Jörg Schek. Query-adaptive data space partitioning using variable-size storage clusters. In Proceedings of the 3rd lnternational Symposium on Large Spatial Databases, Singapore, June 1993.

    Google Scholar 

  2. R. A. Finkel and J. L. Bentley. Quad trees: A data structure for retrieval on composite keys. Acta Informatica, 4:1–9, 1974.

    Google Scholar 

  3. H. Güting and H. P. Kriegel. Multidimensional B-trees: An efficient dynamic file structure for exact match queries. Proceedings of the 10th GI Annual Conference, Informatik-Fachberichte 33, pages 375–388, 1980.

    Google Scholar 

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

    Google Scholar 

  5. H.-J. Schek, H.-B. Paul, M.H. Scholl, and G. Weikum. The DASDBS project: Objectives, experiences, and future prospects. IEEE Transactions on Knowledge and Data Engineering, 2(1):25–43, March 1990.

    Google Scholar 

  6. Hans-Jörg Schek and Marc H. Scholl. The relational model with relation-valued attributes. Information Systems, 11(2):137–147, June 1986.

    Google Scholar 

  7. Wouter B. Teeuw, Christian Rich, Marc H. Scholl, and Henk M. Blanken. An Evaluation of Physical Disk I/Os for Complex Object Processing. In Proc. of the 9 th Int. Conf. on Data Engineering, pages 363–371, April 1993.

    Google Scholar 

  8. Gerhard Weikum. Set-Oriented Disk Access to Large Complex Objects. In Proc. 5 th Int. Conf. on Data Engineering, pages 426–433, February 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jürg Nievergelt Thomas Roos Hans-Jörg Schek Peter Widmayer

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Relly, L., Wolf, A. (1994). A storage manager for the development of spatial data structures. In: Nievergelt, J., Roos, T., Schek, HJ., Widmayer, P. (eds) IGIS '94: Geographic Information Systems. IGIS 1994. Lecture Notes in Computer Science, vol 884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58795-0_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-58795-0_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58795-8

  • Online ISBN: 978-3-540-49105-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics