LevelDB

A research paper by Niv Dayan presents better space-time trade-offs for LSM-tree based key-value stores, the storage architecture behind popular databases like RocksDB and LevelDB. The work, dubbed Dostoevsky, proposes tuning LS M-tree designs to use less memory or disk space without sacrificing read and write performance. It is drawing attention from database engineers and systems researchers.