The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
The PGM-index: a fully-dynamic compressed learned index with provable worst-case bounds
Open accessAbstract
We present the first learned index that supports predecessor, range queries and updates within provably efficient time and space bounds in the worst case. In the (static) context of just predecessor and range queries these bounds turn out to be optimal. We call this learned index the Piecewise Geometric Model index (PGM-index). Its flexible design allows us to introduce three variants which are novel in the context of learned data structures. The first variant of the PGM-index is able to adapt itself to the distribution of the query operations, thus resulting in the first known distribution-aware learned index to date. The second variant exploits the repetitiveness possibly present at the level of the learned models that compose the PGM-index to further compress its succinct space footprint. The third one is a multicriteria variant of the PGM-index that efficiently auto-tunes itself in a few seconds over hundreds of millions of keys to satisfy space-time constraints which evolve over time across users, devices and applications. These theoretical achievements are supported by a large set of experimental results on known datasets which show that the fully-dynamic PGM-index improves the space occupancy of existing traditional and learned indexes by up to three orders of magnitude, while still achieving their same or even better query and update time efficiency. As an example, in the static setting of predecessor and range queries, the PGM-index matches the query performance of a cache-optimised static B+-tree within two orders of magnitude (83×) less space; whereas in the fully-dynamic setting, where insertions and deletions are allowed, the PGM-index improves the query and update time performance of a B + -tree by up to 71% within three orders of magnitude (1140×) less space.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The log-structured merge-tree (LSM-tree)
O’Neil, P., Cheng, E., Gawlick, D., & O’Neil, E. (1996) · Acta Informatica · doi:10.1007/s002360050048 · Cited by 1,317
Pagh, R., & Rodler, F. F. (2004) · Journal of Algorithms · doi:10.1016/j.jalgor.2003.12.002 · Cited by 1,045
The Case for Learned Index Structures
Kraska, T., Beutel, A., Chi, E. H., Dean, J., & Polyzotis, N. (2018) · Proceedings of the 2018 International Conference on Management of Data · doi:10.1145/3183713.3196909 · Cited by 956
Navarro, G., & Mäkinen, V. (2007) · ACM Computing Surveys · doi:10.1145/1216370.1216372 · Cited by 735
Managing Gigabytes: Compressing and Indexing Documents and Images
Witten, I. H., Moffat, A., & Bell, T. C. (1995) · IEEE Transactions on Information Theory · doi:10.1109/tit.1995.476344 · Cited by 726
Bitmap index design and evaluation
Chan, C.-Y., & Ioannidis, Y. E. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276336 · Cited by 360
Seidel, R., & Aragon, C. R. (1996) · Algorithmica · doi:10.1007/bf01940876 · Cited by 281
Maximum error-bounded Piecewise Linear Representation for online stream approximation
Xie, Q., Pang, C., Zhou, X., Zhang, X., & Deng, K. (2014) · The VLDB Journal · doi:10.1007/s00778-014-0355-0 · Cited by 103
Ao, N., Zhang, F., Wu, D., Stones, D. S., Wang, G., Liu, X., Liu, J., & Lin, S. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/2002974.2002975 · Cited by 94
Optimal Bloom Filters and Adaptive Merging for LSM-Trees
Dayan, N., Athanassoulis, M., & Idreos, S. (2018) · ACM Transactions on Database Systems · doi:10.1145/3276980 · Cited by 85
Cited by
Deep learning approaches for similarity computation: A survey
Yang, P., Wang, H., Yang, J., Qian, Z., Zhang, Y., & Lin, X. (2024) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2024.3422484 · Cited by 28
Metadata
- Authors
- Ferragina, P., & Vinciguerra, G.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2020-04
- Volume
- 13
- Issue
- 8
- Pages
- 1162-1175
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2979531022
- Cited by
- 274
- References
- 14
- FWCI
- 10.13
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The PGM-index: a fully-dynamic compressed learned index with provable worst-case bounds. https://app.cochat.ai/papers/10.14778/3389133.3389135
- The paper
- Ferragina, P., & Vinciguerra, G. (2020). The PGM-index: a fully-dynamic compressed learned index with provable worst-case bounds. Proceedings of the VLDB Endowment. https://doi.org/10.14778/3389133.3389135
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.