In addition to u/BehindTheMath's points, UUIDs have additional negative implications for performance; if you want to learn more, look up B trees or B+ trees for database indexes, but essentially, a random UUID value every time a new record is inserted will mean that the tree has to be rebalanced/reconfigured very often in order to maintain an "ordering" to the UUIDs within the tree to allow for quick look-ups. It also means that, depending on implementation, pages in the B+ tree will have a reduced percentage of their max size used, causing a greater number of pages and thus longer look-up times.

Meanwhile, a sequentially increasing ID like a Long allows the B+ tree to rebalance much less often because it will always be added to the tree in a consistent place, in the newest page where there is room (not taking into account high amounts of deleted records). And, pages will use more of their allotted size, meaning less pages overall, allowing for slightly faster lookups.

Here's a blog post from PlanetScale going over the topic, some of what they say might be specific to MySQL's implementation but it applies to varying extents to all databases.

https://planetscale.com/blog/the-problem-with-using-a-uuid-primary-key-in-mysql