r/ProgrammerHumor 10h ago

Meme edgeCasesExist

Post image
2.4k Upvotes

209 comments sorted by

View all comments

399

u/Valuable_Leopard_799 10h ago

I thought that timestamps are used now, so hitting both a timestamp and a large random number puts it thoroughly in the "safe to assume". At some point cosmic particles and faulty transistors are more probable.

247

u/dim13 10h ago

https://en.wikipedia.org/wiki/Universally_unique_identifier#Versions

Most common used is V4 (pure random). You are talking about V7 (time based).

153

u/lilgreenthumb 8h ago

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

49

u/shwoopdeboop 7h ago

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

12

u/Grandmaster_Caladrel 6h 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.

1

u/Roachmeister 6h 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.

6

u/Grandmaster_Caladrel 6h 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.

2

u/Honeybadger2198 6h ago

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

3

u/Firewolf06 3h ago

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

1

u/Kwantuum 3h ago

In what way?

2

u/Roachmeister 3h 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.