warming up your workspaceLoading
Design an LSM-tree storage engine handling 500K writes/sec with compaction, WAL, and bloom filters. Similar to LevelDB/RocksDB.
## Problem
Design a log-structured merge-tree (LSM-tree) storage engine suitable for a high-write-throughput key-value store. Your engine will be the foundation for a distributed database that handles 500K point writes per second on a single node, similar to how LevelDB or RocksDB serves as the storage layer for systems like CockroachDB or TiKV.
Sign up to access the full problem
Design canvas, rubric, hints, and model solutions.