# On some properties of (a,b)-trees

- 154 Downloads

## 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

Recurrence Relation Internal Node Approximate Formula Decimal Digit Usual Technique## Preview

Unable to display preview. Download preview PDF.

## References

- [1]Aho A. V., Sloane N. J. A.: “Some Doubly Exponential Sequences”, Fibonacci Quarterly 11, 4 (1973), 429–437Google Scholar
- [2]Comer D.: “The Ubiquitous B-Tree”, ACM Computing Surveys, 11, 2 (1979), 121–137CrossRefGoogle Scholar
- [3]Flajolet P., Odlyzko A.: “Exploring Binary Trees and Other Simple Trees”, Journal of Computers and System Science, 25, 2 (1982), 171–213CrossRefGoogle Scholar
- [4]Greene D. H., Knuth D. E.:
*Mathematics for the Analysis of Algorithms*, Birkhäuser, Boston, Mass., 1982Google Scholar - [5]Mehlhorn K.:
*Data Structures and Algorithms*1:*Sorting and Searching*, Springer-Verlag, Berlin, 1984Google Scholar - [6]Miller R. E., Pippenger N., Rosenberg A. L., Snyder L.: “Optimal 2-3-trees”, SIAM Journal on Computing, 8, 1 (1979), 42–59CrossRefGoogle Scholar