On optimal multiversion access structures

  • Bruno Becker
  • Stephan Gschwind
  • Thomas Ohler
  • Bernhard Seeger
  • Peter Widmayer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 692)


We propose an asymptotically optimal multiversion B-tree. In our setting, insertions and deletions of data items are allowed only for the present version, whereas range queries and exact match queries are allowed for any version, present or past. The technique we present for transforming a (usual single version) B-tree into a multiversion B-tree is more general: it applies to a number of spatial and non-spatial hierarchical external access structures with certain properties directly, and it can be modified for others. For the B-tree and several other hierarchical external access structures, multiversion capabilities come at no extra cost, neither for storage space nor for runtime, asymptotically in the worst case. The analysis of the behavior of the multiversion B-tree shows that the constant loss of efficiency is low enough to make our suggestion not only a theoretical, but also a practical one.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BHG87]
    P.A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency control and recovery in database systems. Addison Wesley Publ. Co., Reading, Massachusetts, 1987.Google Scholar
  2. [BK91]
    N.S. Barghouti and G.E. Kaiser. Concurrency control in advanced database applications. ACM Computing Surveys, 23(3):269–317, 1991.Google Scholar
  3. [BKSS90]
    N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. ACM SIGMOD International Conf. on Management of Data, 19:322–331, 1990.Google Scholar
  4. [CA86]
    J. Clifford and G. Ariav. Temporal data management: models and systems. New directions for database systems, Eds. Ariav, G. and Clifford, J. Ablex, Publishing Co., Norwood, N.J., pages 168–186, 1986.Google Scholar
  5. [DSST89]
    J.R. Driscoll, N. Sarnak, D.D. Sleator, and R.E. Tarjan. Making data structures persistent. Journal of Comp. and System Sci., 38:86–124, 1989.Google Scholar
  6. [Eas86]
    M. Easton. Key-sequence data sets on indelible storage. IBM J. Res. Development 30, 3, pages 230–241, 1986.Google Scholar
  7. [EWK90]
    R. Elmasri, G. Wuu, and Y.-J. Kim. The time index: An access structure for temporal data. ACM SIGMOD International Conf. on Management of Data, 19:1–12, 1990.Google Scholar
  8. [Fre87]
    M.W. Freeston. The BANG-file: a new kind of grid file. ACM SIGMOD International Conf. on Management of Data, 16:260–269, 1987.Google Scholar
  9. [Gre89]
    D. Greene. An implementation and performance analysis of spatial access methods. Fifth IEEE International Conference on Data Engineering, Los Angeles, 5:606–615, 1989.Google Scholar
  10. [GB91]
    O. Günther and J. Bilmes. Tree-based access methods for spatial databases: implementation and performance evaluation. IEEE Trans. on Knowledge and Data Eng., pages 342–356, 1991.Google Scholar
  11. [Gut84]
    A. Guttman. R-trees: A dynamic index structure for spatial searching. ACM SIGMOD International Conf. on Management of Data, 12:47–57, 1984.Google Scholar
  12. [Kat90]
    R.H. Katz. Towards a unified framework for version modeling in engineering databases. ACM Computing Surveys, 22(4):375–408, 1990.Google Scholar
  13. [KS89]
    C. Kolovson and M. Stonebraker. Indexing techniques for historical databases. IEEE Trans. on Knowledge and Data Eng., pages 127–137, 1989.Google Scholar
  14. [Lan92]
    G. Langran. Time in Geographical Information Systems. Taylor and Francis, 1992.Google Scholar
  15. [LM91]
    S. Lanka and E. Mays. Fully persistent B +-trees. ACM SIGMOD International Conf. on Management of Data, 20:426–435, 1991.Google Scholar
  16. [LS89]
    D. Lomet and B. Salzberg. Access methods for multiversion data. ACM SIGMOD International Conf. on Management of Data, 18:315–324, 1989.Google Scholar
  17. [LS90]
    D. Lomet and B. Salzberg. The performance of a multiversion access method. ACM SIGMOD International Conf. on Management of Data, 19:353–363, 1990.Google Scholar
  18. [Sam89a]
    H. Samet. The design and analysis of spatial data structures. AddisonWesley, 1989.Google Scholar
  19. [Sam89b]
    H. Samet. Applications of spatial data structures: computer graphics, image processing, and GIS. Addison-Wesley, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Bruno Becker
    • 1
  • Stephan Gschwind
    • 1
  • Thomas Ohler
    • 2
  • Bernhard Seeger
    • 3
  • Peter Widmayer
    • 2
  1. 1.Institut für InformatikUniversität FreiburgFreiburg
  2. 2.Institut für Theoretische InformatikETH ZentrumZürich
  3. 3.Institut für InformatikUniversität MünchenMünchen

Personalised recommendations