KVell
Baptiste Lepers, Oana Balmau, Karan Gupta et al. · 2019
Modern block-addressable NVMe SSDs provide much higher bandwidth and similar performance for random and sequential access. Persistent key-value stores (KVs) designed for earlier storage devices, using either Log-Structured Merge (LSM) or B trees, do not take full advantage of these new devices. Logic to avoid random accesses, expensive operations for keeping data sorted on disk, and synchronization bottlenecks make these KVs CPU-bound on NVMe SSDs.
Cited by 152 works. doi:10.1145/3341301.3359628
Authors
References
- Benchmarking cloud serving systems with YCSB
- The log-structured merge-tree (LSM-tree)
- Beating the I/O bottleneck: a case for log-structured file systems
- Fast crash recovery in RAMCloud
- SILT
- Cache craftiness for fast multicore key-value storage
- MICA: A Holistic Approach to Fast In-Memory Key-Value Storage
- Consistent and durable data structures for non-volatile byte-addressable memory
- PebblesDB
- FPTree