4 ms·
What if you just want a stable row ordering, and don't care what that ordering is?
by sakuronto 8y ago
What if you just want a stable row ordering, and don't care what that ordering is?
- DrJosiah 8y agoFor random (and not timespace prefixed) uuids, you can end up hitting more blocks because if locality of reference, if you are using b+trees. If you are using an lsm index, you get blocks of data written at the same time in the index anyway, so your "slow" disk isn't so bad, because that is in your cache already. For b+trees and random uuids, data in blocks are basically scattered everywhere. So your index lookup of 1 billion items could hit 1 billion leaf blocks, instead of 1 billion / entries per leaf.