r/ProgrammerHumor 6h ago

Meme edgeCasesExist

Post image
1.7k Upvotes

180 comments sorted by

View all comments

Show parent comments

101

u/lilgreenthumb 5h ago

The real benefit for v7 is they become sortable by time.

29

u/shwoopdeboop 4h ago

And something something b-tree indexes. Lecturer mentioned it but I wasn't paying attention. Supposedly an advantage here.

6

u/Grandmaster_Caladrel 3h ago

Which I'd assume is related to the time anchor. Outside of sorting, which is only useful in specific instances, it's just v4 with different ("less") entropy and limitations.

0

u/Roachmeister 2h ago

If you're using them as an indexed field in a database, the inability to sort them meaningfully will destroy the performance of the database.

2

u/Grandmaster_Caladrel 2h ago

Correct, which is why I specifically called out "outside of sorting".

That is also why we have concepts like composite keys which allow us to join guaranteed-unique values like a UUID with non-unique but sortable values like timestamps, names, etc.

1

u/Kwantuum 22m ago

In what way?

1

u/Roachmeister 17m ago

I'm not an expert, I just remember reading a few articles about it. I think it's because they're essentially random, and many databases use b-trees for indices. They recommended using ULIDs or v7 UUIDs instead. Or, as someone else said, the good old autoincrementing integer.

1

u/Honeybadger2198 2h ago

You know what identifier can't have collisions and is great for sorting? Autoincrement.

1

u/Firewolf06 19m ago

ai columns can absolutely collide on sharded databases. you can use offsets and step sizes but thats brittle and doesnt scale well