B-slack trees: Highly Space Efficient B-trees

12/13/2017

∙

by   Trevor Brown, et al.

∙

0

∙

share

B-slack trees, a subclass of B-trees that have substantially better worst-case space complexity, are introduced. They store n keys in height O(_b n), where b is the maximum node degree. Updates can be performed in O(_b/2 n) amortized time. A relaxed balance version, which is well suited for concurrent implementation, is also presented.