From Learning to Recycling: A Log-Structured Learned-Less Index
Summary: Learned-Less Index: a log-structured learned index for LSM KV stores that recycles/merges existing linear regression models instead of retraining from sorted keys, making model construction up to 615x faster than Greedy-PLR. Prebuilt models are available at SSTable creation, improving query speed and compaction under high concurrency despite larger prediction error. (summarized by gpt-5-mini on Apr 11 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Hera Koo (Sungkyunkwan University)
- 2. Sungho Moon (Sungkyunkwan University)
- 3. Sangeun Chae (Sungkyunkwan University)
- 4. Wook-Hee Kim (Konkuk University)
- 5. Jongmoo Choi (Dankook University)
- 6. Beomseok Nam (Sungkyunkwan University)
BibTeX Citation
@inproceedings{koo_sigmod26,
title = {{From Learning to Recycling: A Log-Structured Learned-Less Index}},
author = {Koo, Hera and Moon, Sungho and Chae, Sangeun and Kim, Wook-Hee and Choi, Jongmoo and Nam, Beomseok},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3786654},
url = {https://dl.acm.org/doi/10.1145/3786654},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 40 | The Case for Learned Index Structures | 2018 | SIGMOD | 0.00046284649 |
| 430 | ALEX: An Updatable Adaptive Learned Index | 2020 | SIGMOD | 0.00018409112 |
| 463 | The PGM-index: a fully-dynamic compressed learned index with provable worst-case bounds | 2020 | VLDB | 0.00017804544 |
| 779 | FITing-Tree: A Data-aware Index Structure | 2019 | SIGMOD | 0.00014030069 |
| 848 | Benchmarking Learned Indexes | 2021 | VLDB | 0.00013506188 |
| 1,550 | Updatable Learned Index with Precise Positions | 2021 | VLDB | 0.00010282449 |
| 1,569 | Compaction management in distributed key-value datastores | 2015 | VLDB | 0.00010211433 |
| 9,593 | Can Learned Indexes be Built Efficiently? A Deep Dive into Sampling Trade-offs | 2024 | SIGMOD | 5.156392e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,721 | Hist-Tree: Those Who Ignore It Are Doomed to Learn | 2021 | CIDR |
| 2 | 8,378 | Tuning Hierarchical Learned Indexes on Disk and Beyond | 2022 | SIGMOD |
| 3 | 10,844 | Rethinking Learned Index and LSM-tree Integration | 2026 | VLDB |
| 4 | 10,489 | On Self-Designing Learned Indexes | 2026 | SIGMOD |
| 5 | 10,475 | LINE: A Learned Index with Group-Enhanced Leaves and Cache-Optimized Inner Tree | 2026 | SIGMOD |
| 6 | 2,636 | Are Updatable Learned Indexes Ready? | 2022 | VLDB |
| 7 | 6,863 | Accelerating String-key Learned Index Structures via Memoization-based Incremental Training | 2024 | VLDB |
| 8 | 6,821 | Making In-Memory Learned Indexes Efficient on Disk | 2024 | SIGMOD |
| 9 | 848 | Benchmarking Learned Indexes | 2021 | VLDB |
| 10 | 3,697 | Learned Index: A Comprehensive Experimental Evaluation | 2023 | VLDB |