Yhn ScienceSpace first seen 3 d ago, last 43 min ago, peak #6

New Paper Proposes Better Trade-Offs for LSM-Tree Key-Value Stores

Original: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores [pdf]

A research paper by Niv Dayan outlines techniques that improve the space-time trade-offs in LSM-tree based key-value stores, the storage architecture behind databases like RocksDB and LevelDB. The work, presented as Dostoevsky, explores tuning read, write, and space amplification to get better performance from the same storage. Engineers and database researchers are discussing the ideas and their practical implications.

Why now: Database engineers are interested in practical performance improvements to a widely used storage engine design.

Niv DayanLSM-treeRocksDBLevelDBDostoevsky

Open on hn →

Rank over time, top of the chart is #1. 9 snapshots from 11 h ago to 43 min ago.

Evidence

• Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores [pdf] · ibobev · 36

API: https://socialmediatrends-api.osmike.com/v1/trends/1168782