The PGM-index: a fully-dynamic compressed learned index with provable worst-case bounds
Summary: Introduces PGM-index, the first fully dynamic learned index with provable worst-case bounds and optimal static predecessor/range performance. Distribution-aware, repetitive-model compression, and multicriteria variants yield orders-of-magnitude space savings over B+-trees. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Paolo Ferragina (University of Pisa)
- 2. Giorgio Vinciguerra (University of Pisa)
BibTeX Citation
@article{ferragina_vldb20,
title = {{The PGM-index: a fully-dynamic compressed learned index with provable worst-case bounds}},
author = {Ferragina, Paolo and Vinciguerra, Giorgio},
journal = {PVLDB},
series = {{VLDB} '20},
volume = {13},
number = {8},
pages = {1162--1175},
doi = {10.14778/3389133.3389135},
url = {https://doi.org/10.14778/3389133.3389135},
year = {2020}
}Incoming Citations (Sorted by Pagerank)
Showing 50 of 78 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 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.00046363107 |
| 206 | Cache Conscious Indexing for Decision-Support in Main Memory | 1999 | VLDB | 0.00024981343 |
| 555 | SageDB: A Learned Database System | 2019 | CIDR | 0.0001650754 |
| 768 | FITing-Tree: A Data-aware Index Structure | 2019 | SIGMOD | 0.00014107655 |
| 769 | Bitmap Index Design and Evaluation | 1998 | SIGMOD | 0.00014106166 |
| 1,316 | Building a Bw-Tree Takes More Than Just Buzz Words | 2018 | SIGMOD | 0.00011046804 |
| 1,506 | BF-Tree: Approximate Tree Indexing | 2014 | VLDB | 0.00010448376 |
| 1,653 | Efficient Parallel Lists Intersection and Index Compression Algorithms using Graphics Processing Units | 2011 | VLDB | 9.969498e-05 |
| 1,731 | Indexable PLA for Efficient Similarity Search | 2007 | VLDB | 9.7633789e-05 |
| 2,011 | An Experimental Study of Bitmap Compression vs. Inverted List Compression | 2017 | SIGMOD | 9.1924806e-05 |
| 2,880 | Optimal Column Layout for Hybrid Workloads | 2019 | VLDB | 7.9118308e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,559 | On Two-Dimensional Indexability and Optimal Range Search Indexing (Extended Abstract) | 1999 | PODS |
| 2 | 6,070 | When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories | 2023 | SIGMOD |
| 3 | 8,382 | Tuning Hierarchical Learned Indexes on Disk and Beyond | 2022 | SIGMOD |
| 4 | 4,715 | Hist-Tree: Those Who Ignore It Are Doomed to Learn | 2021 | CIDR |
| 5 | 835 | Benchmarking Learned Indexes | 2021 | VLDB |
| 6 | 6,613 | Making In-Memory Learned Indexes Efficient on Disk | 2024 | SIGMOD |
| 7 | 3,621 | Learned Index: A Comprehensive Experimental Evaluation | 2023 | VLDB |
| 8 | 5,378 | Updatable Learned Indexes Meet Disk-Resident DBMS - From Evaluations to Design Choices | 2023 | SIGMOD |
| 9 | 9,110 | Dynamic Indexability and Lower Bounds for Dynamic One-Dimensional Range Query Indexes | 2009 | PODS |
| 10 | 8,882 | Why Are Learned Indexes So Effective but Sometimes Ineffective? | 2025 | VLDB |