An adaptive overflow technique for B-trees
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.
- [AS72]M. Abramowitz and I. Stegun. Handbook of Mathematical Functions. Dover, New York, 1972.Google Scholar
- [BY87]R.A. Baeza-Yates. Analyzing deletions in B-trees. Dept. of Computer Science, Univ. of Waterloo (unpublished manuscript), 1987.Google Scholar
- [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
- [JS89]T. Johnson and D. Shasha. Utilization of B-trees with inserts, deletes and modifies. In PODS'89, pages 235–246, 1989.Google Scholar
- [Miz79]T. Mizoguchi. On required space for random split trees. In Allerton Conference, pages 265–273, Monticello, IL, 1979.Google Scholar