Toy LSM-tree key-value store written in Go, built from scratch to actually understand storage engine internals. Skip list memtable (coin-flip height promotion, no rotation logic), write-ahead log for durability, Redis-style command dispatcher (SET/GET/DEL). WAL binary format: op byte + keylen (4 bytes BE) + key + vallen (insert only) + value. Replay-on-startup rebuilds the skip list before the API accepts requests, treating mid-record EOF as a hard error to avoid replaying a corrupt tail.
Toy LSM-tree key-value store written in Go, built from scratch to actually understand storage engine internals. Skip list memtable (coin-flip height promotion, no rotation logic), write-ahead log for durability, Redis-style command dispatcher (SET/GET/DEL). WAL binary format: op byte + keylen (4 bytes BE) + key + vallen (insert only) + value. Replay-on-startup rebuilds the skip list before the API accepts requests, treating mid-record EOF as a hard error to avoid replaying a corrupt tail.