ALCOMFT-TR-01-52

Lars Jacobsen and Kim S. Larsen
Variants of (a,b)-Trees with Relaxed Balance
Århus. Work packages 1, 4 and 5. May 2001.

Abstract: New variants of (a,b)-trees with relaxed balance are proposed. These variants have better space utilization than the earlier proposals, while the asymptotic complexity of rebalancing is unchanged. The proof of complexity, which is derived, is much simpler than the ones previously published. Through experiments, some of the most interesting applications of this data structure are modeled, and it is demonstrated that the new variants are competitive.

Postscript file: ALCOMFT-TR-01-52.ps.gz (137 kb).