Variants of (a,b)-Trees with Relaxed Balance.

Variants of (a,b)-Trees with Relaxed Balance.: Lars Jacobsen and Kim S. Larsen.
International Journal of Foundations of Computer Science, 12(4): 455-478, 2001.

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.

The publication is available from ScienceDirect (subscription may be required).
Other publications by the author.

Last modified: Wed May 15 08:23:31 CEST 2013

Kim Skak Larsen (kslarsen@imada.sdu.dk)