Abstract
In this paper some properties of (a,b)-trees are studied. Such trees are a generalization of B-trees and therefore their performances are dependent upon their height. Hence it is important to be able to enumerate the (a,b)-trees of a given height. To this purpose, a recurrence relation is defined which cannot be solved by the usual techniques. Therefore some limitations are established to the number of (a,b)-trees of a given height and an approximate formula is given which shows that the sequence of such numbers is a doubly exponential one. As a consequence of this fact, some properties, as for instance the probability that the height grows by the effects of an insertion, are studied using “profiles”. The proofs are given of how profiles are generated and how from a profile one can get the number of corresponding (a,b)-trees.
Keywords
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.
Preview
Unable to display preview. Download preview PDF.
References
Aho A. V., Sloane N. J. A.: “Some Doubly Exponential Sequences”, Fibonacci Quarterly 11, 4 (1973), 429–437
Comer D.: “The Ubiquitous B-Tree”, ACM Computing Surveys, 11, 2 (1979), 121–137
Flajolet P., Odlyzko A.: “Exploring Binary Trees and Other Simple Trees”, Journal of Computers and System Science, 25, 2 (1982), 171–213
Greene D. H., Knuth D. E.: Mathematics for the Analysis of Algorithms, Birkhäuser, Boston, Mass., 1982
Mehlhorn K.: Data Structures and Algorithms 1: Sorting and Searching, Springer-Verlag, Berlin, 1984
Miller R. E., Pippenger N., Rosenberg A. L., Snyder L.: “Optimal 2-3-trees”, SIAM Journal on Computing, 8, 1 (1979), 42–59
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sprugnoli, R., Barcucci, E., Chiuderi, A., Pinzani, R. (1989). On some properties of (a,b)-trees. In: Djidjev, H. (eds) Optimal Algorithms. OA 1989. Lecture Notes in Computer Science, vol 401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51859-2_13
Download citation
DOI: https://doi.org/10.1007/3-540-51859-2_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51859-4
Online ISBN: 978-3-540-46831-8
eBook Packages: Springer Book Archive