Load-Balancing Succinct B Trees

Tomohiro I, Dominik Köppl

We propose a B tree representation storing $n$ keys, each of $k$ bits, in either (a) $nk+O(nk/\lg n)$ bits or (b) $nk+O(nk\lg \lg n/\lg n)$ bits of space supporting all B t…