I guess ordered KV stores usually requires total order on they, and that if two keys are identical they refer to the same data. Randomizing the hash value is g

I guess ordered KV stores usually requires total order on they, and that if two keys are identical they refer to the same data. Randomizing the hash value is great for unordered maps, but for ordered maps you sometimes want to extract a range which can be done faster if you have them ordered for example in a b-tree.