Abstract
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.
(Extended Abstract)
This work was supported by an Ontario Graduate Scholarship.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Abramowitz and I. Stegun. Handbook of Mathematical Functions. Dover, New York, 1972.
R. Bayer and E.M. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, 1(3):173–189, 1972.
R.A. Baeza-Yates. Analyzing deletions in B-trees. Dept. of Computer Science, Univ. of Waterloo (unpublished manuscript), 1987.
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.
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.
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.
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.
T. Johnson and D. Shasha. Utilization of B-trees with inserts, deletes and modifies. In PODS'89, pages 235–246, 1989.
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.
T. Mizoguchi. On required space for random split trees. In Allerton Conference, pages 265–273, Monticello, IL, 1979.
A.C-C. Yao. On random 2–3 trees. Acta Informatica, 9(2):159–170, 1978.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baeza-Yates, R.A. (1990). An adaptive overflow technique for B-trees. In: Bancilhon, F., Thanos, C., Tsichritzis, D. (eds) Advances in Database Technology — EDBT '90. EDBT 1990. Lecture Notes in Computer Science, vol 416. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022161
Download citation
DOI: https://doi.org/10.1007/BFb0022161
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52291-1
Online ISBN: 978-3-540-46948-3
eBook Packages: Springer Book Archive