Partitions4
Total Messages0
P00
P10
P20
P30
Partition 0offset: 0
empty
Partition 1offset: 0
empty
Partition 2offset: 0
empty
Partition 3offset: 0
empty
Routing: hash(key) % 4 → same key always goes to same partition → ordering preserved per key

// event log

No events yet.

// how it works

  • Messages are append-only (immutable log)
  • Partition key determines which partition
  • Same key → same partition → strict ordering
  • Different partitions processed in parallel

// trade-offs

  • Scalable — add partitions for more throughput
  • Replay-able — consumers can seek to any offset
  • No global ordering across partitions
  • Hot keys create partition hotspots