Wisckey: Separating keys from values in ssd-conscious storage
We present WiscKey, a persistent LSM-tree-based key-value store with a performance-
oriented data layout that separates keys from values to minimize I/O amplification. The …
oriented data layout that separates keys from values to minimize I/O amplification. The …
Pebblesdb: Building key-value stores using fragmented log-structured merge trees
Key-value stores such as LevelDB and RocksDB offer excellent write throughput, but suffer
high write amplification. The write amplification problem is due to the Log-Structured Merge …
high write amplification. The write amplification problem is due to the Log-Structured Merge …
Monkey: Optimal navigable key-value store
In this paper, we show that key-value stores backed by an LSM-tree exhibit an intrinsic trade-
off between lookup cost, update cost, and main memory footprint, yet all existing designs …
off between lookup cost, update cost, and main memory footprint, yet all existing designs …
{SLM-DB}:{Single-Level}{Key-Value} store with persistent memory
This paper investigates how to leverage emerging byte-addressable persistent memory
(PM) to enhance the performance of key-value (KV) stores. We present a novel KV store, the …
(PM) to enhance the performance of key-value (KV) stores. We present a novel KV store, the …
Dostoevsky: Better space-time trade-offs for LSM-tree based key-value stores via adaptive removal of superfluous merging
In this paper, we show that all mainstream LSM-tree based key-value stores in the literature
and in industry are suboptimal with respect to how they trade off among the I/O costs of …
and in industry are suboptimal with respect to how they trade off among the I/O costs of …
{LSM-trie}: An {LSM-tree-based}{Ultra-Large}{Key-Value} Store for Small Data Items
Key-value (KV) stores have become a backbone of large-scale applications in today's data
centers. The data set of the store on a single server can grow to billions of KV items or many …
centers. The data set of the store on a single server can grow to billions of KV items or many …
Wander join: Online aggregation via random walks
Joins are expensive, and online aggregation over joins was proposed to mitigate the cost,
which offers users a nice and flexible tradeoff between query efficiency and accuracy in a …
which offers users a nice and flexible tradeoff between query efficiency and accuracy in a …
bLSM: a general purpose log structured merge tree
R Sears, R Ramakrishnan - Proceedings of the 2012 ACM SIGMOD …, 2012 - dl.acm.org
Data management workloads are increasingly write-intensive and subject to strict latency
SLAs. This presents a dilemma: Update in place systems have unmatched latency but poor …
SLAs. This presents a dilemma: Update in place systems have unmatched latency but poor …
An efficient design and implementation of LSM-tree based key-value store on open-channel SSD
Various key-value (KV) stores are widely employed for data management to support Internet
services as they offer higher efficiency, scalability, and availability than relational database …
services as they offer higher efficiency, scalability, and availability than relational database …
X-Engine: An optimized storage engine for large-scale E-commerce transaction processing
Alibaba runs the largest e-commerce platform in the world serving more than 600 million
customers, with a GMV (gross merchandise value) exceeding USD 768 billion in FY2018 …
customers, with a GMV (gross merchandise value) exceeding USD 768 billion in FY2018 …