Splaying Log-Structured Merge-Trees

Summary: Proposes a simple, generic 'splaying' scheme for LSM-trees to improve read performance under nonuniform, read-heavy windows. Copying hot keys to the top of the LSM-tree reduces disk I/Os; a lightweight, general enhancement for any LSM-based KV store. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 5505
Venue: SIGMOD
Year: 2018
Pagerank: 5.093636e-05
Overall Rank: 11,908 | 18.31%
DOI: 10.1145/3183713.3183723

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Thomas Lively (Harvard University)
2. Luca Schroeder (Harvard University)
3. Carlos Mendizábal (Harvard University)

BibTeX Citation

@inproceedings{lively_sigmod18,
        title = {{Splaying Log-Structured Merge-Trees}},
        author = {Lively, Thomas and Schroeder, Luca and Mendizábal, Carlos},
        series = {{SIGMOD} '18},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3183713.3183723},
        url = {https://dl.acm.org/doi/10.1145/3183713.3183723},
        year = {2018}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
446	Monkey: Optimal Navigable Key-Value Store	2017	SIGMOD	0.00018332392

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	10,480	PartitionKV: Redesigning LSM-tree KV Stores on NVMs with Adaptive Partitioning for Reducing Write Stalls and Amplification	2026	SIGMOD
2	831	Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging	2018	SIGMOD
3	857	SlimDB: A Space-Efficient Key-Value Storage Engine For Semi-Sorted Data	2017	VLDB
4	7,459	Efficient Data Ingestion and Query Processing for LSM-Based Storage Systems	2019	VLDB
5	9,457	Rethinking The Compaction Policies in LSM-trees	2025	SIGMOD
6	4,262	On Performance Stability in LSM-based Storage Systems	2020	VLDB
7	6,828	Breaking Down Memory Walls in LSM-based Storage Systems	2020	SIGMOD
8	5,229	Dissecting, Designing, and Optimizing LSM-based Data Stores	2022	SIGMOD
9	7,274	LSM-Trees and B-Trees: The Best of Both Worlds	2019	SIGMOD
10	1,502	The Log-Structured Merge-Bush & the Wacky Continuum	2019	SIGMOD