By default LMDB uses lexicographical order for keys in it's B+ tree. This can be overridden by providing a custom comparison function or by modifiying the stored keys so they sort differently.
Is there any performance difference when iterating backwards over the tree, versus forwards? I expect to search always in the descending, backwards direction, so I want to know if that's fine or if I should consider changing the order of how records are inserted.