Skip to main content

A flexible and extensible index manager for spatial database systems

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

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

  • 151 Accesses

Abstract

The management of spatial data in applications such as graphics and image processing, geography as well as computer aided design (CAD) imposes stringent new requirements on socalled spatial database systems. In this paper we propose a flexible and extensible index manager for efficient query processing in spatial database systems by integrating spatial access methods. An essential ingredient for efficient query processing is spatial clustering of objects using common clustering properties, such as spatial location. In our approach an extensible set of alternative access paths is provided, in order to accelerate queries on properties which are not supported by clustering. Clustering and alternative access paths are organized in such a way that redundant storage of objects as well as time consuming reorganizations are avoided. This guarantees flexibility with respect to storage and access of the objects as well as efficient query processing. To support the index manager, we propose a storage method for handling arbitrary long objects, which is suitable in an environment that demands for clustering and multiple indexing.

This work was supported by grant no. Kr 670/4-3 from the Deutsche Forschungsgemeinschaft (German Research Society)

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. Bayer, R. & E. McCreight, ‘Organization and Maintenance of Large Ordered Indexes', Acta Informatica, Vol. 1, No. 3, 173–189, 1972.

    Article  Google Scholar 

  2. Beckmann, N., H.P. Kriegel, R. Schneider & B. Seeger, The R*-tree: An efficient and robust access method for points and rectangles', in Proc. 1990 ACM SIGMOD International Conference on Management of Data, 322–331, Atlantic City, USA, May 1990.

    Google Scholar 

  3. Chou, H.-T., D.J. DeWitt, R.H. Katz & A.C. Klug, ‘Design and Implementation of the Wisconsin Storage System', Software Practice and Experience, Vol. 15 (10), 943–962, October 1985.

    Google Scholar 

  4. Carey, M. J., D.J. DeWitt, J.E. Richardson & E.J. Shekita, ‘Object and File Management in the EXODUS Extensible Database System', Proc. 12 th Int. Conf. on Very Large Data Bases, Kyoto, Japan, August 1986.

    Google Scholar 

  5. Günther, O. & J. Bilmes, ‘The Implementation of the Cell-tree: Design alternatives and performance evaluation', Technical Report TRCS88-23, University of California, Santa Barbara, October 1988.

    Google Scholar 

  6. Güting, R.H., ‘Gral: an extensible relational database system for geografic applications', Proc. 15th Int. Conf. on Very Large Data Bases, 33–44, Amsterdam, The Netherlands, August 1989.

    Google Scholar 

  7. Guttman A.: ‘R-trees: a dynamic index structure for spatial searching', Proc. ACM SIGMOD Int. Conf. on Management of Data, 47–57, June 1984.

    Google Scholar 

  8. Jhingran, A. & M. Stonebraker, ‘Alternatives in Complex Object Representation: A Performance Perspective', Proc. 6th Int. Conf. on Data Engineering, 94–102, Los Angeles, February 1990.

    Google Scholar 

  9. Khoshafian, S.N. & G.P. Copeland, ‘Object Identity', Proc. of OOPSLA, 1986.

    Google Scholar 

  10. Kim, W., K.-C. Kim & A. Dale, ‘Indexing Techniques for Object-Oriented Databases', in Kim W. & F. Lochovsky, (Eds.), ‘Object-Oriented Concepts, Databases, and Applications', Addison-Wesley Publishing Company, Inc., 371–394, 1989.

    Google Scholar 

  11. Kriegel, H.P., P. Heep, S. Heep, M. Schiwietz & R. Schneider, ‘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 

  12. Kriegel, H.P. & B. Seeger, ‘Multidimensional order preserving linear hashing with partial expansions', Proc. Int. Conf. on Database Theory, Lecture Notes in Computer Science 243, 203–220, 1986.

    Google Scholar 

  13. Kriegel, H.P. & B. Seeger, ‘PLOP-Hashing: a grid file without directory', Proc. 4th Int. Conf. on Data Engineering, 369–376, Los Angeles, February 1988.

    Google Scholar 

  14. Kriegel, H.P. & R. Schneider, ‘Entwurf eines Bioindikations-Datenbanksystems', in Proc. 5. Symposium ‘Informatik für den Umweltschutz', Wien, September 1990.

    Google Scholar 

  15. Kriegel, H.P., M. Schiwietz, R. Schneider & B.Seeger, ‘Performance Comparison of Point and Spatial Access Methods', in Proceedings “Symposium on the Design and Implementation of Large Spatial Databases”, 89–114, Santa Barbara, USA, July 1989.

    Google Scholar 

  16. Larson, P.-A., ‘Linear Hashing with partial expansions', Proc. 6th Int. Conf. on Very Large Data Bases, 212–223, 1980.

    Google Scholar 

  17. Lehman, T.J. & B.G. Lindsay, ‘The Starburst Long Field Manager', Proc. 15th Int Conf. on Very Large Data Bases, Amsterdam, The Netherlands, August 1989.

    Google Scholar 

  18. Nievergelt J., H. Hinterberger & K.C. Sevcik: The grid file: an adaptable, symmetric multikey file structure', ACM Trans. on Database Systems, Vol. 9, 1, 38–71, 1984.

    Article  Google Scholar 

  19. Roussopoulos N. & D. Leifker ‘Direct spatial search on pictorial databases using packed R-trees', Proc. ACM SIGMOD Int. Conf. on Managment of Data, 17–31, May 1985.

    Google Scholar 

  20. Samet, H., ‘The Design and Analysis of Spatial Structures', Addison-Wesley Publishing Company Inc., 1990.

    Google Scholar 

  21. Shipman, D., ‘The functional data model and the data language DAPLEX', ACM Transactions on Database Systems, Vol. 6, No. 1, March 1981.

    Google Scholar 

  22. Stonebraker, M., H. Stettner, N. Lynn, J. Kalash & A. Guttman, ‘Document Processing in a Relational Database System', ACM Transactions on Office Information Systems, Vol. 1, No. 2, April 1983.

    Google Scholar 

  23. Seeger, B. & H.P. Kriegel, ‘The Buddy Tree: An Efficient and Robust Access Method for Spatial Databases', Proc. 16th Int. Conf. on Very Large Data Bases, Brisbane, Australia, August 1990.

    Google Scholar 

  24. Stonebraker, M. & L. Rowe, ‘The Design of POSTGRES', Proc. 1986 ACM SIGMOD Conf. on Management of Data, Washington DC, May 1986.

    Google Scholar 

  25. Valduriez, P., ‘Join Indices, ACM Transactions on Database Systems', Vol. 12, No. 2, June 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

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

Kriegel, HP., Heep, P., Heep, S., Schiwietz, M., Schneider, R. (1992). A flexible and extensible index manager for spatial database systems. 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_23

Download citation

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

  • 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