LSM-trees

A research paper by Niv Dayan presents Dostoevsky, a redesigned approach to LSM-tree based key-value stores that achieves better trade-offs between memory use and performance. The work details cost-tuning techniques that let storage engines deliver lower write amplification and faster lookups with the same hardware. Engineers interested in database internals and storage engine design are discussing the findings.