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
- 2. Manos Athanassoulis
- 3. Stratos Idreos
Incoming Citations (Sorted by Pagerank)
Showing 29 of 79 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 |
|---|---|---|---|---|
| 281 | LinkBench: a Database Benchmark Based on the Facebook Social Graph | 2013 | SIGMOD | 0.0002906793 |
| 379 | bLSM: A General Purpose Log Structured Merge Tree | 2012 | SIGMOD | 0.0002493527 |
| 563 | Tree Indexing on Solid State Drives | 2010 | VLDB | 0.00020031827 |
| 569 | Optimizing Space Amplification in RocksDB | 2017 | CIDR | 0.00019924098 |
| 694 | Analyzing the Energy Efficiency of a Database Server | 2010 | SIGMOD | 0.00018061803 |
| 1,117 | Cache-Oblivious String B-trees | 2006 | PODS | 0.00013882205 |
| 1,960 | Compaction management in distributed key-value datastores | 2015 | VLDB | 9.9521444e-05 |
| 2,915 | Brainwash: A Data System for Feature Engineering | 2013 | CIDR | 7.9078385e-05 |
| 5,119 | Design Tradeoffs of Data Access Methods | 2016 | SIGMOD | 5.6807904e-05 |
Previous
Page 1 / 1
Next