Indexing in flash storage devices: a survey on challenges, current approaches, and future trends
Indexes are special purpose data structures, designed to facilitate and speed up the access
to the contents of a file. Indexing has been actively and extensively investigated in DBMSes …
to the contents of a file. Indexing has been actively and extensively investigated in DBMSes …
Constructing and Analyzing the LSM Compaction Design Space (Updated Version)
Log-structured merge (LSM) trees offer efficient ingestion by appending incoming data, and
thus, are widely used as the storage layer of production NoSQL data stores. To enable …
thus, are widely used as the storage layer of production NoSQL data stores. To enable …
{AC-Key}: Adaptive caching for {LSM-based}{Key-Value} stores
Read performance of LSM-tree-based Key-Value Stores suffers from serious read
amplification caused by the leveled structure used to improve write performance. Caching is …
amplification caused by the leveled structure used to improve write performance. Caching is …
Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed
The Log Structured Merge Trees (LSM-tree) based key-value stores are widely used in
many storage systems to support a variety of operations such as updates, point reads, and …
many storage systems to support a variety of operations such as updates, point reads, and …
Bi-directional Log-Structured Merge Tree
The Log-Structured Merge (LSM) Tree has become a popular storage scheme for modern
NoSQL and New SQL database systems. The LSM-tree scheme achieves high write …
NoSQL and New SQL database systems. The LSM-tree scheme achieves high write …
Unifying the data center caching layer: Feasible? profitable?
Data centers today host large numbers of workloads and many of these workloads consume
significant storage resources. Given the long history of successes in storage caching, it is …
significant storage resources. Given the long history of successes in storage caching, it is …
Enabling efficient updates in KV storage via hashing: Design and performance evaluation
Persistent key-value (KV) stores mostly build on the Log-Structured Merge (LSM) tree for
high write performance, yet the LSM-tree suffers from the inherently high I/O amplification …
high write performance, yet the LSM-tree suffers from the inherently high I/O amplification …
Range Cache: An Efficient Cache Component for Accelerating Range Queries on LSM-Based Key-Value Stores
LSM-tree has been widely used in key-value stores to offer high write throughputs. However,
LSM-tree suffers from the block-cache invalidation problem caused by periodical …
LSM-tree suffers from the block-cache invalidation problem caused by periodical …
The Design and Implementation of UniKV for Mixed Key-Value Storage Workloads
Persistent key-value (KV) stores are mainly designed based on the Log-Structured Merge-
tree (LSM-tree), yet they suffer from large read and write amplifications, especially when KV …
tree (LSM-tree), yet they suffer from large read and write amplifications, especially when KV …