3 ms·
Not that much slower than bigint as long as you replace the top one or two bytes in the UUID with a rotating per-minute counter. You keep 106 bits of entropy (
by ttfkam 4y ago
Not that much slower than bigint as long as you replace the top one or two bytes in the UUID with a rotating per-minute counter.
You keep 106 bits of entropy (from v4's 122 bits) while largely eliminating page faults. Walkability is eliminated while not leaking too much temporal info.
https://www.2ndquadrant.com/en/blog/sequential-uuid-generators/ https://www.2ndquadrant.com/en/blog/sequential-uuid-generato...