Mnemosyne: Dynamic Workload-Aware BF Tuning via Accurate Statistics in LSM trees

Summary: Mnemosyne dynamically reallocates Bloom Filters for evolving LSM trees, tuning memory without workload knowledge. It adds Merlin, a sliding-window per-file tracker, and Mnemosyne+ with a refined per-file cost model. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 7308
Venue: SIGMOD
Year: 2025
Pagerank: 5.4171036e-05
Overall Rank: 8,475 | 41.86%
DOI: 10.1145/3725327

Incoming Non-self Citations Over Time

Authors

1. Zichen Zhu (Boston University)
2. Yanpeng Wei (Tsinghua University)
3. Ju Hyoung Mun (Brandeis University)
4. Manos Athanassoulis (Boston University)

BibTeX Citation

@inproceedings{zhu_sigmod25,
        title = {{Mnemosyne: Dynamic Workload-Aware BF Tuning via Accurate Statistics in LSM trees}},
        author = {Zhu, Zichen and Wei, Yanpeng and Mun, Ju Hyoung and Athanassoulis, Manos},
        series = {{SIGMOD} '25},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3725327},
        url = {https://dl.acm.org/doi/10.1145/3725327},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
8,811	ArceKV: Towards Workload-driven LSM-compactions for Key-Value Store Under Dynamic Workloads	2026	VLDB	5.3652966e-05
10,225	Dynamic Flat Filter: A Unified Framework for Scalable and Stable Fingerprint-Based Filters	2026	SIGMOD	5.093636e-05
10,465	Improving Range Scan Performance in LSM-trees with Group Caching	2026	SIGMOD	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 25 of 25 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
275	bLSM: A General Purpose Log Structured Merge Tree	2012	SIGMOD	0.00022630189
446	Monkey: Optimal Navigable Key-Value Store	2017	SIGMOD	0.00018332392
461	Query-based Workload Forecasting for Self-Driving Database Management Systems	2018	SIGMOD	0.00018068441
831	Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging	2018	SIGMOD	0.00013748512
857	SlimDB: A Space-Efficient Key-Value Storage Engine For Semi-Sorted Data	2017	VLDB	0.00013568886
1,015	AsterixDB: A Scalable, Open Source BDMS	2014	VLDB	0.00012647763
1,347	X-Engine: An Optimized Storage Engine for Large-scale E-commerce Transaction Processing	2019	SIGMOD	0.00011073571
1,502	The Log-Structured Merge-Bush & the Wacky Continuum	2019	SIGMOD	0.00010557694
1,942	Design Continuums and the Path Toward Self-Designing Key-Value Stores that Know and Learn	2019	CIDR	9.4451535e-05
1,954	Chucky: A Succinct Cuckoo Filter for LSM-Tree	2021	SIGMOD	9.4208165e-05
1,975	Morton Filters: Faster, Space-Efficient Cuckoo Filters via Biasing, Compression, and Decoupled Logical Sparsity	2018	VLDB	9.3645236e-05
2,755	Lethe: A Tunable Delete-Aware LSM Engine	2020	SIGMOD	8.163097e-05
3,005	Constructing and Analyzing the LSM Compaction Design Space	2021	VLDB	7.8608206e-05
3,054	Spooky: Granulating LSM-Tree Compactions Correctly	2022	VLDB	7.8090808e-05
3,773	SplinterDB and Maplets: Improving the Tradeoffs in Key-Value Store Compaction Policy	2023	SIGMOD	7.1384476e-05
3,793	Apache IoTDB: A Time Series Database for IoT Applications	2023	SIGMOD	7.1217835e-05
3,798	Vector Quotient Filters: Overcoming the Time/Space Trade-Off in Filter Design	2021	SIGMOD	7.1165678e-05
3,802	Leaper: A Learned Prefetcher for Cache Invalidation in LSM-tree based Storage Engines	2020	VLDB	7.1115502e-05
4,960	InfiniFilter: Expanding Filters to Infinity and Beyond	2023	SIGMOD	6.4280133e-05
5,226	Breaking Down Memory Walls: Adaptive Memory Management in LSM-based Storage Systems	2021	VLDB	6.3090383e-05
6,710	PIM-tree: A Skew-resistant Index for Processing-in-Memory	2023	VLDB	5.796491e-05
6,742	Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index	2024	VLDB	5.7862414e-05
6,828	Breaking Down Memory Walls in LSM-based Storage Systems	2020	SIGMOD	5.7601608e-05
7,263	Catalyst: Optimizing Cache Management for Large In-memory Key-value Systems	2023	VLDB	5.6611756e-05
7,469	Optimizing Collections of Bloom Filters within a Space Budget	2024	VLDB	5.609743e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	1,502	The Log-Structured Merge-Bush & the Wacky Continuum	2019	SIGMOD
2	11,908	Splaying Log-Structured Merge-Trees	2018	SIGMOD
3	7,459	Efficient Data Ingestion and Query Processing for LSM-Based Storage Systems	2019	VLDB
4	5,226	Breaking Down Memory Walls: Adaptive Memory Management in LSM-based Storage Systems	2021	VLDB
5	11,554	Workload-Adaptive Filtering in Storage Engines	2022	SIGMOD
6	9,457	Rethinking The Compaction Policies in LSM-trees	2025	SIGMOD
7	9,021	Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in A Colossal Configuration Space	2024	SIGMOD
8	446	Monkey: Optimal Navigable Key-Value Store	2017	SIGMOD
9	6,828	Breaking Down Memory Walls in LSM-based Storage Systems	2020	SIGMOD
10	275	bLSM: A General Purpose Log Structured Merge Tree	2012	SIGMOD