Multi-version Indexing in Flash-based Key-Value Stores
Pulkit A. Misra, Jeffrey S. Chase, Johannes Gehrke, Alvin R., Lebeck

TL;DR
This paper introduces SkimpyFTL, a multi-version key-value store optimized for flash SSDs, which leverages remap-on-write to efficiently manage multiple data versions, balancing memory use and lookup speed.
Contribution
The paper presents SkimpyFTL, a novel multi-version indexing approach integrated with flash translation layers, exploiting remap-on-write for improved performance and capacity management.
Findings
Efficient multi-version management leveraging flash SSD properties.
Tradeoff mechanism between memory capacity and lookup latency.
Enhanced concurrency and performance in key-value stores.
Abstract
Maintaining multiple versions of data is popular in key-value stores since it increases concurrency and improves performance. However, designing a multi-version key-value store entails several challenges, such as additional capacity for storing extra versions and an indexing mechanism for mapping versions of a key to their values. We present SkimpyFTL, a FTL-integrated multi-version key-value store that exploits the remap-on-write property of flash-based SSDs for multi-versioning and provides a tradeoff between memory capacity and lookup latency for indexing.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Storage Technologies · Peer-to-Peer Network Technologies · Caching and Content Delivery
