An adaptive overflow technique for B-trees

  • Ricardo A. Baeza-Yates
Session 2: Data Structures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 416)


We present a new overflow technique for the B-tree. The technique is a hybrid of partial expansions and unbalanced splits. This technique is asymmetric and adaptive. Considering a growing file (only insertions), the storage utilization is 77% for random keys, 70% for sorted keys, and over 75% for non-uniform distributed keys. Similar results are achieved when we have deletions mixed with insertions. One of the main properties of this technique is that the storage utilization is very stable with respect to changes of the data distribution. This technique may be used for other bucket-based file structures, like extendible hashing or bounded disorder files.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AS72]
    M. Abramowitz and I. Stegun. Handbook of Mathematical Functions. Dover, New York, 1972.Google Scholar
  2. [BM72]
    R. Bayer and E.M. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, 1(3):173–189, 1972.CrossRefGoogle Scholar
  3. [BY87]
    R.A. Baeza-Yates. Analyzing deletions in B-trees. Dept. of Computer Science, Univ. of Waterloo (unpublished manuscript), 1987.Google Scholar
  4. [BY89a]
    R.A. Baeza-Yates. Expected behaviour of B +-trees under random insertions. Acta Informatica, 26(5):439–472, 1989. Also as Research Report CS-86-67, University of Waterloo, 1986.CrossRefGoogle Scholar
  5. [BY89b]
    R.A. Baeza-Yates. Modeling splits in file structures. Acta Informatica, 26(4):349–362, 1989. Also as Institute for Computer Research Report UW/ICR 87-08, 1987.CrossRefGoogle Scholar
  6. [BYL89]
    R.A. Baeza-Yates and P-Å. Larson. Performance of B +-trees with partial expansions. IEEE Trans. on Knowledge and Data Engineering, 1:to appear, 1989. Also as Research Report CS-87-04, Dept. of Computer Science, University of Waterloo, 1987.Google Scholar
  7. [EZG+82]
    B. Eisenbarth, N. Ziviani, Gaston H. Gonnet, Kurt Mehlhorn, and Derick Wood. The theory of fringe analysis and its application to 2–3 trees and B-trees. Information and Control, 55(1):125–174, Oct 1982.CrossRefGoogle Scholar
  8. [JS89]
    T. Johnson and D. Shasha. Utilization of B-trees with inserts, deletes and modifies. In PODS'89, pages 235–246, 1989.Google Scholar
  9. [Lom87]
    D. Lomet. Partial expansions for file organizations with an index. ACM TODS, 12:65–84, 1987. Also as tech report, Wang Institute, TR-86-06, 1986.CrossRefGoogle Scholar
  10. [Miz79]
    T. Mizoguchi. On required space for random split trees. In Allerton Conference, pages 265–273, Monticello, IL, 1979.Google Scholar
  11. [Yao78]
    A.C-C. Yao. On random 2–3 trees. Acta Informatica, 9(2):159–170, 1978.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Ricardo A. Baeza-Yates
    • 1
  1. 1.Departamento de Ciencias de la ComputaciónUniversidad de ChileSantiagoChile

Personalised recommendations