Database Paper Browser

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
6642
Venue
SIGMOD
Year
2023
Pagerank
5.0589805e-05
Overall Rank
6,445 | 55.17%
DOI
10.1145/3589284

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

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

Overall Rank Paper Year Venue Pagerank
102 The Case for Learned Index Structures 2018 SIGMOD 0.00049545203
826 ALEX: An Updatable Adaptive Learned Index 2020 SIGMOD 0.00016224841
10,038 Understanding Robustness Issues of Updatable Learned Indexes: [Experiments & Analysis] 2026 SIGMOD 4.1945683e-05
9,746 Why Are Learned Indexes So Effective but Sometimes Ineffective? 2025 VLDB 4.2897489e-05
1,460 Benchmarking Learned Indexes 2021 VLDB 0.00011887068
8,811 Tuning Hierarchical Learned Indexes on Disk and Beyond 2022 SIGMOD 4.4441574e-05
5,074 Learned Index: A Comprehensive Experimental Evaluation 2023 VLDB 5.7175726e-05
4,128 Are Updatable Learned Indexes Ready? 2022 VLDB 6.4292373e-05
2,552 Updatable Learned Index with Precise Positions 2021 VLDB 8.5530411e-05
7,390 Making In-Memory Learned Indexes Efficient on Disk 2024 SIGMOD 4.7431654e-05