LSM-trees

A paper by Niv Dayan presents Dostoevsky, a redesign of LSM-tree based key-value stores that achieves better trade-offs between storage space and performance. The work introduces tunable designs that reduce the write amplification and memory costs of widely used storage engines such as RocksDB. Engineers and database researchers are discussing its implications for real-world systems that rely on LSM-based storage.