The Log-Structured Merge-Bush & the Wacky Continuum
Summary: Introduces LSM-Bush, an LSM with increasing adjacent-level capacity ratios (doubly-exponential) that drops write cost to O(log log N) and reshapes reads/memory. Presents Wacky, a continuum from lazy to greedy merge policies that can be instantiated in one system and analytically tuned to workload-specific trade-offs (e.g., range reads). (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Niv Dayan (Harvard University)
- 2. Stratos Idreos (Harvard University)
BibTeX Citation
@inproceedings{dayan_sigmod19,
title = {{The Log-Structured Merge-Bush \& the Wacky Continuum}},
author = {Dayan, Niv and Idreos, Stratos},
series = {{SIGMOD} '19},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3299869.3319903},
url = {https://dl.acm.org/doi/10.1145/3299869.3319903},
year = {2019}
}Incoming Citations (Sorted by Pagerank)
Showing 46 of 46 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 21 of 21 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,041 | Dissecting, Designing, and Optimizing LSM-based Data Stores | 2022 | SIGMOD |
| 2 | 2,771 | Constructing and Analyzing the LSM Compaction Design Space | 2021 | VLDB |
| 3 | 753 | Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging | 2018 | SIGMOD |
| 4 | 6,639 | LSM-Trees and B-Trees: The Best of Both Worlds | 2019 | SIGMOD |
| 5 | 9,140 | Rethinking The Compaction Policies in LSM-trees | 2025 | SIGMOD |
| 6 | 400 | Monkey: Optimal Navigable Key-Value Store | 2017 | SIGMOD |
| 7 | 1,891 | Design Continuums and the Path Toward Self-Designing Key-Value Stores that Know and Learn | 2019 | CIDR |
| 8 | 6,934 | Breaking Down Memory Walls in LSM-based Storage Systems | 2020 | SIGMOD |
| 9 | 9,191 | Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in A Colossal Configuration Space | 2024 | SIGMOD |
| 10 | 12,214 | Splaying Log-Structured Merge-Trees | 2018 | SIGMOD |