Re:Show HN: 128-bit, roughly-ordered, URL-safe UUIDs
by tomsmeding on Friday January 22, 2021 @06:36AM
(#25870746)
Excuse my possible ignorance, but how is more entropy in a primary key going to hurt index performance? The fanout in a b-tree is completely in control of the database, and not dependent at all on properties of the data — apart, of course, from the size of the data, since typically the node fanout is precisely the number of fields that fit in one disk page. Randomness does not influence the size of a UUID on disk.
[ Parent
| on HN ]
Re:Show HN: 128-bit, roughly-ordered, URL-safe UUIDs
by rapidlua on Friday January 22, 2021 @06:58AM
(#25870880)
With random keys updates are going to touch way more pages than with sequential ones. It increases IO due to more dirty buffers and journaling.
Re:Show HN: 128-bit, roughly-ordered, URL-safe UUIDs
by tomsmeding on Friday January 22, 2021 @10:49AM
(#25872645)
Point taken. Quite true.
Re:Show HN: 128-bit, roughly-ordered, URL-safe UUIDs
by Tostino on Friday January 22, 2021 @12:40PM
(#25873982)
More reading on this for Postgres: https://www.2ndquadrant.com/en/blog/sequential-uuid-generato...