4 ms·
> 30% faster and 7% smaller than uuidv4 Why would UUIDv7 be more compact than v4? Doesn’t it take the same number of bits?
by semiquaver 3y ago
> 30% faster and
7% smaller than uuidv4
Why would UUIDv7 be more compact than v4? Doesn’t it take the same number of bits?
- masklinn 3y agoThe random insertion location of UUID4 causes bloat (at least index bloat) as it forces splitting leaves in order to add new entries, so you end up with a lot more partial leaves: with sequential insertion (sequences, uuid7) the leaves get filled and when a leaf is filled you append a new one, you don’t go and revisit leaves.