Back to papers
SplinterDB and Maplets: Improving the Tradeoffs in Key-Value Store Compaction Policy
Summary: Replaces filters with quotient maplets, lossy metadata that resizes without touching data, decoupling data compaction from metadata. Matches SplinterDB insertion and beats RocksDB throughput, enabling scalable RAM-based queries via quotient maplets and targeted reclamation.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 6549
- Venue
- SIGMOD
- Year
- 2023
- Pagerank
- 5.8157107e-05
- Overall Rank
- 4,945 | 65.60%
- DOI
-
10.1145/3588726
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 15 of 15 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 5,863 |
GRF: A Global Range Filter for LSM-Trees with Shape Encoding |
2024 |
SIGMOD |
5.2979639e-05 |
| 7,663 |
Optimizing Collections of Bloom Filters within a Space Budget |
2024 |
VLDB |
4.6857816e-05 |
| 7,694 |
LSMGraph: A High-Performance Dynamic Graph Storage System with Multi-Level CSR |
2024 |
SIGMOD |
4.6757592e-05 |
| 7,808 |
CaaS-LSM: Compaction-as-a-Service for LSM-based Key-Value Stores in Storage Disaggregated Infrastructure |
2024 |
SIGMOD |
4.6455813e-05 |
| 8,525 |
Aleph Filter: To Infinity in Constant Time |
2024 |
VLDB |
4.4937074e-05 |
| 9,071 |
Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in A Colossal Configuration Space |
2024 |
SIGMOD |
4.4025274e-05 |
| 9,386 |
Rethinking The Compaction Policies in LSM-trees |
2025 |
SIGMOD |
4.3455975e-05 |
| 9,465 |
Disco: A Compact Index for LSM-trees |
2025 |
SIGMOD |
4.3350926e-05 |
| 9,529 |
Mnemosyne: Dynamic Workload-Aware BF Tuning via Accurate Statistics in LSM trees |
2025 |
SIGMOD |
4.32934e-05 |
| 10,063 |
Counting Is All You Need for Instant Tuple Discovery: Enabling Real-Time HTAP in Standalone DBMSs |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,080 |
Focus! Fast On-disk Concurrency-control Using Sketches |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,137 |
Aeris Filter: A Strongly and Monotonically Adaptive Range Filter |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,145 |
Breadcrumb Filters: Fast Fully Featured Filters |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,176 |
Improving Range Scan Performance in LSM-trees with Group Caching |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,773 |
From FASTER to F2: Evolving Concurrent Key-Value Store Designs for Large Skewed Workloads |
2025 |
VLDB |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 13 of 13 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 609 |
Monkey: Optimal Navigable Key-Value Store |
2017 |
SIGMOD |
0.0001923446 |
| 899 |
Faster: A Concurrent Key-Value Store with In-Place Updates |
2018 |
SIGMOD |
0.00015509287 |
| 1,248 |
Don't Thrash: How to Cache Your Hash on Flash |
2012 |
VLDB |
0.00013046661 |
| 1,311 |
Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging |
2018 |
SIGMOD |
0.00012657439 |
| 1,366 |
SlimDB: A Space-Efficient Key-Value Storage Engine For Semi-Sorted Data |
2017 |
VLDB |
0.00012357685 |
| 2,109 |
The Log-Structured Merge-Bush & the Wacky Continuum |
2019 |
SIGMOD |
9.5318694e-05 |
| 2,606 |
Design Continuums and the Path Toward Self-Designing Key-Value Stores that Know and Learn |
2019 |
CIDR |
8.4645832e-05 |
| 2,798 |
Chucky: A Succinct Cuckoo Filter for LSM-Tree |
2021 |
SIGMOD |
8.1080111e-05 |
| 2,843 |
A General-Purpose Counting Filter: Making Every Bit Count |
2017 |
SIGMOD |
8.0257314e-05 |
| 3,793 |
Constructing and Analyzing the LSM Compaction Design Space |
2021 |
VLDB |
6.7617833e-05 |
| 4,914 |
On Performance Stability in LSM-based Storage Systems |
2020 |
VLDB |
5.8315684e-05 |
| 6,113 |
Compactionary: A Dictionary for LSM Compactions |
2022 |
SIGMOD |
5.20426e-05 |
| 7,218 |
Breaking Down Memory Walls in LSM-based Storage Systems |
2020 |
SIGMOD |
4.7982543e-05 |
Semantically Similar Papers