Improve btree performance

[DissectBot]

Huge btrees are currently very expensive to iterate over. The caching currently in place grows very large and isn’t very efficient.

Currently all the already known keys and items are cached for each level of the tree. Perhaps this should also be LRU cached. The node header (and buffer) are also cached. This should maybe also be LRU cached somewhere else.