Disco: A Compact Index for LSM-trees

Summary: Disco indexes all keys in LSM-trees, a compact index that avoids per-run scans with compact key representations to reduce comparisons and I/Os. Queries incur at most one I/O to runs, delivering near B+-tree read efficiency and retaining write performance. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 7093
Venue: SIGMOD
Year: 2025
Pagerank: 5.2533796e-05
Overall Rank: 9,535 | 34.59%
DOI: 10.1145/3709683

Incoming Non-self Citations Over Time

Authors

1. Wenshao Zhong (ByteDance; University of Illinois Chicago)
2. Chen Chen (University of Illinois Chicago)
3. Xingbo Wu (Microsoft)
4. Jakob Eriksson (University of Illinois Chicago)

BibTeX Citation

@inproceedings{zhong_sigmod25,
        title = {{Disco: A Compact Index for LSM-trees}},
        author = {Zhong, Wenshao and Chen, Chen and Wu, Xingbo and Eriksson, Jakob},
        series = {{SIGMOD} '25},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3709683},
        url = {https://dl.acm.org/doi/10.1145/3709683},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 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,134	A Multi-tenant Relational OLTP Database at Salesforce	2026	CIDR	5.093636e-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
512	Tree Indexing on Solid State Drives	2010	VLDB	0.00017196795
831	Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging	2018	SIGMOD	0.00013748512
880	SuRF: Practical Range Query Filtering with Fast Succinct Tries	2018	SIGMOD	0.00013432693
882	HOT: A Height Optimized Trie Index for Main-Memory Database Systems	2018	SIGMOD	0.0001342403
1,502	The Log-Structured Merge-Bush & the Wacky Continuum	2019	SIGMOD	0.00010557694
1,954	Chucky: A Succinct Cuckoo Filter for LSM-Tree	2021	SIGMOD	9.4208165e-05
2,698	Rosetta: A Robust Space-Time Optimized Range Filter for Key-Value Stores	2020	SIGMOD	8.2450522e-05
2,919	SNARF: A Learning-Enhanced Range Filter	2022	VLDB	7.9628657e-05
3,005	Constructing and Analyzing the LSM Compaction Design Space	2021	VLDB	7.8608206e-05
3,758	Nova-LSM: A Distributed, Component-based LSM-tree Key-value Store	2021	SIGMOD	7.1471346e-05
3,773	SplinterDB and Maplets: Improving the Tradeoffs in Key-Value Store Compaction Policy	2023	SIGMOD	7.1384476e-05
4,119	Proteus: A Self-Designing Range Filter	2022	SIGMOD	6.8907395e-05
4,664	GRF: A Global Range Filter for LSM-Trees with Shape Encoding	2024	SIGMOD	6.5787544e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	5,229	Dissecting, Designing, and Optimizing LSM-based Data Stores	2022	SIGMOD
2	5,852	DEX: Scalable Range Indexing on Disaggregated Memory	2024	VLDB
3	3,005	Constructing and Analyzing the LSM Compaction Design Space	2021	VLDB
4	7,459	Efficient Data Ingestion and Query Processing for LSM-Based Storage Systems	2019	VLDB
5	9,021	Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in A Colossal Configuration Space	2024	SIGMOD
6	857	SlimDB: A Space-Efficient Key-Value Storage Engine For Semi-Sorted Data	2017	VLDB
7	11,908	Splaying Log-Structured Merge-Trees	2018	SIGMOD
8	9,457	Rethinking The Compaction Policies in LSM-trees	2025	SIGMOD
9	5,780	Compactionary: A Dictionary for LSM Compactions	2022	SIGMOD
10	6,687	Making In-Memory Learned Indexes Efficient on Disk	2024	SIGMOD