DBScholar

Back to papers

Updatable Learned Indexes Meet Disk-Resident DBMS - From Evaluations to Design Choices

Summary: Disk-resident updatable learned indexes vs B+-tree; four SOTA methods implemented. Findings: B+-tree robust on disk; learned indexes beat it only on select workloads; design principles: lower height, lean structures, faster scans, compact storage. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6704
Venue
SIGMOD
Year
2023
Pagerank
6.2242567e-05
Overall Rank
5,423 | 62.80%
DOI
10.1145/3589284

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{lan_sigmod23,
        title = {{Updatable Learned Indexes Meet Disk-Resident DBMS - From Evaluations to Design Choices}},
        author = {Lan, Hai and Bao, Zhifeng and Culpepper, J. Shane and Borovica-Gajic, Renata},
        series = {{SIGMOD} '23},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3589284},
        url = {https://dl.acm.org/doi/10.1145/3589284},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 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