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.
Exploring cascaded write amplification in lsm-tree based key-value stores with solid-state disks
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DB 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
support 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.