Monkey: Optimal Navigable Key-Value Store
Summary: LSM-tree KV stores face a trade-off among lookup cost, update cost, and memory. Monkey co-tunes merge policy, buffer, and per-level Bloom filters to minimize total Bloom false positives, guided by a closed-form model; LevelDB experiments show 50–80% lower lookup latency as data grows. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Niv Dayan (Harvard University)
- 2. Manos Athanassoulis (Harvard University)
- 3. Stratos Idreos (Harvard University)
BibTeX Citation
@inproceedings{dayan_sigmod17,
title = {{Monkey: Optimal Navigable Key-Value Store}},
author = {Dayan, Niv and Athanassoulis, Manos and Idreos, Stratos},
series = {{SIGMOD} '17},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3035918.3064054},
url = {https://dl.acm.org/doi/10.1145/3035918.3064054},
year = {2017}
}Incoming Citations (Sorted by Pagerank)
Showing 50 of 87 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 236 | LinkBench: a Database Benchmark Based on the Facebook Social Graph | 2013 | SIGMOD | 0.00023671522 |
| 258 | bLSM: A General Purpose Log Structured Merge Tree | 2012 | SIGMOD | 0.00022939599 |
| 436 | Optimizing Space Amplification in RocksDB | 2017 | CIDR | 0.00018319035 |
| 513 | Tree Indexing on Solid State Drives | 2010 | VLDB | 0.00017044842 |
| 902 | Analyzing the Energy Efficiency of a Database Server | 2010 | SIGMOD | 0.00013184118 |
| 1,074 | Cache-Oblivious String B-trees | 2006 | PODS | 0.00012162592 |
| 1,569 | Compaction management in distributed key-value datastores | 2015 | VLDB | 0.00010211433 |
| 2,586 | Brainwash: A Data System for Feature Engineering | 2013 | CIDR | 8.2560072e-05 |
| 4,885 | Design Tradeoffs of Data Access Methods | 2016 | SIGMOD | 6.3706825e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 816 | SlimDB: A Space-Efficient Key-Value Storage Engine For Semi-Sorted Data | 2017 | VLDB |
| 2 | 9,130 | Rethinking The Compaction Policies in LSM-trees | 2025 | SIGMOD |
| 3 | 6,932 | Breaking Down Memory Walls in LSM-based Storage Systems | 2020 | SIGMOD |
| 4 | 6,124 | Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic Workloads | 2023 | SIGMOD |
| 5 | 754 | Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging | 2018 | SIGMOD |
| 6 | 6,635 | LSM-Trees and B-Trees: The Best of Both Worlds | 2019 | SIGMOD |
| 7 | 8,640 | Mnemosyne: Dynamic Workload-Aware BF Tuning via Accurate Statistics in LSM trees | 2025 | SIGMOD |
| 8 | 1,422 | The Log-Structured Merge-Bush & the Wacky Continuum | 2019 | SIGMOD |
| 9 | 12,208 | Splaying Log-Structured Merge-Trees | 2018 | SIGMOD |
| 10 | 9,181 | Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in A Colossal Configuration Space | 2024 | SIGMOD |