Wisckey: Separating keys from values in ssd-conscious storage

L Lu, TS Pillai, H Gopalakrishnan… - ACM Transactions On …, 2017 - dl.acm.org
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 …

Pebblesdb: Building key-value stores using fragmented log-structured merge trees

P Raju, R Kadekodi, V Chidambaram… - Proceedings of the 26th …, 2017 - dl.acm.org
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 …

Monkey: Optimal navigable key-value store

N Dayan, M Athanassoulis, S Idreos - Proceedings of the 2017 ACM …, 2017 - dl.acm.org
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 …

{SLM-DB}:{Single-Level}{Key-Value} store with persistent memory

O Kaiyrakhmet, S Lee, B Nam, SH Noh… - 17th USENIX Conference …, 2019 - usenix.org
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 …

Dostoevsky: Better space-time trade-offs for LSM-tree based key-value stores via adaptive removal of superfluous merging

N Dayan, S Idreos - Proceedings of the 2018 International Conference …, 2018 - dl.acm.org
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 …

{LSM-trie}: An {LSM-tree-based}{Ultra-Large}{Key-Value} Store for Small Data Items

X Wu, Y Xu, Z Shao, S Jiang - 2015 USENIX Annual Technical …, 2015 - usenix.org
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 …

Wander join: Online aggregation via random walks

F Li, B Wu, K Yi, Z Zhao - … of the 2016 International Conference on …, 2016 - dl.acm.org
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 …

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 …

An efficient design and implementation of LSM-tree based key-value store on open-channel SSD

P Wang, G Sun, S Jiang, J Ouyang, S Lin… - Proceedings of the …, 2014 - dl.acm.org
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 …

X-Engine: An optimized storage engine for large-scale E-commerce transaction processing

G Huang, X Cheng, J Wang, Y Wang, D He… - Proceedings of the …, 2019 - dl.acm.org
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 …