Subtrack

Build a Simple Key-Value Store

Build an LSM-tree based key-value store from scratch. Implement a skip-list memtable, SSTable flush, compaction, Bloom filters, MVCC, WAL recovery, and benchmark your engine.

Start Learning

~315 Minutes 7 Challenges

Tasks (7)

LSM-Tree Memtable Using a Skip List

hard

Flush a Memtable to Disk as an SSTable

hard

Build a Simple Key-Value Store

Tasks (7)

LSM-Tree Memtable Using a Skip List

Flush a Memtable to Disk as an SSTable

Compaction: Merging SSTables

Bloom Filters for Fast Negative Lookups

Multi-Version Concurrency Control (MVCC)

Crash Recovery Using WAL and Checkpoints

Benchmark Your Key-Value Store