Dostoevsky proposes an adaptive approach to removing superfluous merging in LSM-tree based key-value stores, achieving better space-time trade-offs. The technique intelligently skips unnecessary merge operations while maintaining storage efficiency and query performance.
Background
LSM-trees are widely used in key-value stores like RocksDB and LevelDB for write-heavy workloads. Their merge-and-compact processes significantly impact storage efficiency and read performance, making optimization opportunities highly valuable.
- Source
- Lobsters
- Published
- Oct 6, 2026 at 04:18 AM
- Score
- 7.0 / 10