> EB trees heavily rely on bit-addressable data (typically integers) That seems like a disavantage, but actually most data is bit-addressable in one way or the

> EB trees heavily rely on bit-addressable data (typically integers) That seems like a disavantage, but actually most data is bit-addressable in one way or the other; even strings, if you look at the UTF-8 representation. What I'm a bit worried is the number of levels: it seems to be 1 level per bit in the key. And "a tree node is typically 20-bytes long on a 32-bit system". So that is 20 bytes per bit in the key. I wonder if the memory usage could be reduced in a simple way. For example using larger "pages" that contain arrays.