BVLSM separates keys from values at WAL-write time, stores big values in multi-queue BValue files, and reports up to 7.6x write throughput over RocksDB and 1.9x over BlobDB on 64KB random writes.
O’Neil, Edward Cheng, Dieter Gawlick, and Elizabeth O’Neil
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.DB 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
BVLSM: Write-Efficient LSM-Tree Storage via WAL-Time Key-Value Separation
BVLSM separates keys from values at WAL-write time, stores big values in multi-queue BValue files, and reports up to 7.6x write throughput over RocksDB and 1.9x over BlobDB on 64KB random writes.