Comment by falcolas

> the best-performing data structure for looking up sorted keys cannot do those queries faster than O(log(n))

Feels like a digression off the actual tree structure, but isn't this incorrect, since a hash map can do key lookups in O(1)? With caveats, of course.

It's a great idea over all, but I'd also be curious how well overlaying an event log on a cuckoo hash would work in comparison.