Why do random UUIDs make bad database primary keys?

Two costs: size and locality. At 128 bits they double the storage of every key, index entry, and foreign key versus a 64-bit ID. Worse, random values insert at random positions in the B-tree, so under write load the working set becomes the entire index instead of the hot rightmost pages, causing page splits and buffer pool thrashing. Time-ordered formats like UUIDv7 fix the locality problem; the size cost remains.

What happens if two Snowflake generators end up with the same machine ID?

They silently mint colliding IDs whenever they generate in the same millisecond, and nothing detects it at generation time; you find out from unique-constraint violations or corrupted references downstream. This is why machine ID assignment must be enforced, not conventional: lease it from ZooKeeper or etcd at startup, or derive it from an orchestrator-guaranteed identity like a StatefulSet ordinal, and refuse to start without one.

Do I need a distributed ID generator, or is my database sequence fine?

If you have one writer database, the sequence is fine and simpler than anything in this course; use BIGINT and move on. The distributed generator earns its complexity when you shard writes across databases, generate IDs in services before any database write, or need IDs at rates a single sequence cannot serve. Adopting Snowflake before sharding is prepaying for a problem you may never have.

Common Designschapter 7 of 8 · 3 lessons

Distributed ID Generator

Generate globally unique, roughly-sortable IDs across many machines without coordination.

← All chapters View in cheatsheet

Every design in this course quietly assumed it. The chat system needed time-sortable message identifiers, the feed needed pagination cursors, the shortener needed unique numbers to encode.

Generating unique identifiers on one machine is a sequence. Generating them on a hundred machines, millions a second, without those machines talking to each other, is a real design problem with a famous solution and several sharp edges. It is also the piece nobody designs deliberately, because it gets chosen in an afternoon by whoever sets up the first table, and everything built afterwards inherits it.

Lessons

3 in this chapter

Requirements and the Obvious CandidatesUnique, sortable, compact, coordination-free: pick any three and you get a familiar failure.3 min
The Snowflake Layout64 bits split three ways: when, where, and how many this millisecond.3 min
Clock Skew and the AlternativesSnowflake's only external dependency is the clock, and clocks go backward.3 min