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 …
Spooky: granulating LSM-tree compactions correctly
N Dayan, T Weiss, S Dashevsky, M Pan… - Proceedings of the …, 2022 - dl.acm.org
Modern storage engines and key-value stores have come to rely on the log-structured
merge-tree (LSM-tree) as their core data structure. LSM-tree operates by gradually merge …
merge-tree (LSM-tree) as their core data structure. LSM-tree operates by gradually merge …
The LSM design space and its read optimizations
Log-structured merge (LSM) trees have emerged as one of the most commonly used storage-
based data structures in modern data systems as they offer high throughput for writes and …
based data structures in modern data systems as they offer high throughput for writes and …
Dissecting, designing, and optimizing LSM-based data stores
Log-structured merge (LSM) trees have emerged as one of the most commonly used disk-
based data structures in modern data systems. LSM-trees employ out-of-place ingestion to …
based data structures in modern data systems. LSM-trees employ out-of-place ingestion to …
CruiseDB: An LSM-tree key-value store with both better tail throughput and tail latency
Due to excellent performance, LSM-tree key-value stores have been widely used in various
applications in recent years. However, LSM-tree's inherent batched data processing …
applications in recent years. However, LSM-tree's inherent batched data processing …
Elastic and stable compaction for LSM-tree: A FaaS-based approach on TerarkDB
LSM-tree is widely used as a write-optimized storage engine in many NoSQL systems.
However, the periodical compaction operations in LSM-tree cost many I/O bandwidths and …
However, the periodical compaction operations in LSM-tree cost many I/O bandwidths and …
Closing the performance gap between leveling and tiering compaction via bundle compaction
So far, most LSM-tree-based storage engines adopt either leveling or tiering compaction.
We note that while leveling compaction can deliver high search performance and low space …
We note that while leveling compaction can deliver high search performance and low space …
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 …
PM-Blade: A Persistent Memory Augmented LSM-tree Storage for Database
Y Zhang, H Hu, X Zhou, E **e, H Ren… - 2023 IEEE 39th …, 2023 - ieeexplore.ieee.org
In this paper, we present PM-Blade, an LSM-tree structured storage augmented with
persistent memory (or non-volatile memory). PM-Blade utilizes persistent memory to …
persistent memory (or non-volatile memory). PM-Blade utilizes persistent memory to …
Toward a better understanding and evaluation of tree structures on flash ssds
Solid-state drives (SSDs) are extensively used to deploy persistent data stores, as they
provide low latency random access, high write throughput, high data density, and low cost …
provide low latency random access, high write throughput, high data density, and low cost …