lab
Distributed systems and storage engine concepts, visualized. Click any tile to explore.
A 5-node cluster. One follower times out, starts an election, collects a majority, wins.
Insert keys into an order-3 B-tree. Watch nodes fill up and split, propagating upward.
Write keys into the memtable. Watch it flush to L0, compact to L1, cascade to L2.
Write entries to the WAL, commit, then crash. Replay the log to restore DB state.
Keys and virtual nodes on a ring. Add or remove a server and see minimal key remapping.
Insert keys through 3 hash functions. Query any string and witness a false positive.