A Flexible and Extensible Index Manager for Spatial Database Systems

  • Hans-Peter Kriegel
  • Peter Heep
  • Stephan Heep
  • Michael Schiwietz
  • Ralf Schneider
Conference paper


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. 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.


Spatial Object Storage Method Inverted Index Atomic Attribute Access Path 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BM 72]
    Bayer, R. & E. McCreight,’Organization and Maintenance of Large Ordered Indexes’, Acta Informatics, Vol. 1, No. 3, 173–189, 1972.CrossRefGoogle Scholar
  2. [BKSS 90]
    Beckmann, N., H.P. Kriegel, R. Schneider & B. Seeger, ‘The R5-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.CrossRefGoogle Scholar
  3. [CDKK 85]
    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.CrossRefGoogle Scholar
  4. [CDRS 86]
    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. [GB 88]
    Ginther, O. & J. Barnes, 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. [Guet 89]
    Gifting, R.H.,’Oral: an extensible relational database system for geogtafic applications’, Proc. 15th Int. Conf. on Very Large Data Bases, 33–44, Amsterdam, The Netherlands, August 1989.Google Scholar
  7. [Gutt 84]
    Guttman A.: ‘R-trees: • dynamic index structure for spatial searching’, Proc. ACM SIGMOD Int. Conf. on Management of Data, 47–57, June 1984.Google Scholar
  8. [JS 90]
    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. [KC 86]
    Khoshafian, S.N. & O.P. Copeland, ‘Object Identity’, Proc. Of OOPSLA, 1986.Google Scholar
  10. [KKD 89]
    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. [Krie 91]
    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. [KS 86]
    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.CrossRefGoogle Scholar
  13. [KS 88]
    Kriegel, H.P. & B. Seeger, PLOP-Hashing: • grid file without directory’, Proc. 4th Int. Conf. on Data Engineering, 369–376, Los Angeles, February 1988.Google Scholar
  14. [KS 90]
    Kriegel, H.P. & R. Schneider, ‘Entwurf eines Bioindikations-Datenbanksyatems’, in Proc. 5.Symposium ‘Informatik fir den Umweltschutz’, Wien, September 1990.Google Scholar
  15. [KSSS 89]
    Kriegel, H.P., M. Schiwietz, R. Schneider amp; 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. [Lars 80]
    Larson, P.-A., ‘Linear Hashing with partial expansion’, Proc. 6th Int. Conf. on Very Large Data Bases, 212–223, 1980.Google Scholar
  17. [LL 89]
    Lehman, T.J. & B.G. Lindsay, The Starbunt Long Field Manager’, Proc. 15th Int. Conf. on Very Large Data Bases, Amsterdam, The Netherlands, August 1989.Google Scholar
  18. [NHS 84]
    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.CrossRefGoogle Scholar
  19. [RL 85]
    Roussopoulos N. & D. Leiflter. ‘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. [Same 90).
    Samet, H., ‘The Design and Analysis of Spatial Structures’, Addison-Wesley Publishing Company Inc., 1990.Google Scholar
  21. [Ship 81]
    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. [Ston 83]
    Stonebraker, M., H. Stettner, N. Lynn, J. Kalish & A. Guttman, ‘Document Processing in a Relational Database System’, ACM Transactions on Office Information Systems, Vol. 1, No. 2, April 1983.Google Scholar
  23. [SK 90]
    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. [SR 86]
    Stonebraker, M. & L. Rowe, ‘The Design of POSTORES’, Proc. 1986 ACM SIGMOD Conf. on Management of Data, Washington DC, May 1986.Google Scholar
  25. [Veld 87]
    Valduriez, P., ‘Join Indices, ACM Transactions on Database Systems’, Vol. 12, No. 2, June 1987.Google Scholar

Copyright information

© Springer-Verlag Wien 1991

Authors and Affiliations

  • Hans-Peter Kriegel
    • 1
  • Peter Heep
    • 2
  • Stephan Heep
    • 3
  • Michael Schiwietz
    • 1
  • Ralf Schneider
    • 1
  1. 1.Institut für InformatikUniversität MünchenMünchen 40Germany
  2. 2.NANU NANA GmbHOldenburgGermany
  3. 3.Praktische InformatikUniversität BremenBremen 33Germany

Personalised recommendations