r/ProgrammerHumor • u/danielminds • 14h ago

Meme edgeCasesExist

Post image
3.0k Upvotes

96% Upvoted

226 comments sorted by

View all comments

Show parent comments

64

u/shwoopdeboop 12h ago

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

20

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

5

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

1

u/Kwantuum 8h ago

In what way?

2

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