Pick one and press Start, then click Next › to step through it.
Watch for
The memtable filling then emptying on each flush, and SSTables cascading downward as levels merge — that downward flow is write amplification, the price of keeping reads fast.
More about this scenario
You'll learn
Why writes are cheap (append to memory) while reads and disk space cost more later — the core trade an LSM tree makes.
How it runs
Each PUT fills the in-memory memtable; FLUSH freezes it into an immutable L0 SSTable on disk; COMPACT merges SSTables down the levels. Then a GET walks memtable → levels and a DELETE writes a tombstone.