The PGM-index: a fully-dynamic compressed learned index with provable worst-case bounds
Summary: PGM-index is a dynamic, compressed learned index with provable bounds for predecessor, range queries and updates. Distribution-aware, repetition-based compression and multicriteria auto-tuning enable large space reductions with competitive times vs B+-trees. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 20 of 70 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 |
|---|---|---|---|---|
| 101 | The Case for Learned Index Structures | 2018 | SIGMOD | 0.00049778866 |
| 240 | Cache Conscious Indexing for Decision-Support in Main Memory | 1999 | VLDB | 0.00031526134 |
| 796 | SageDB: A Learned Database System | 2019 | CIDR | 0.00016541749 |
| 1,033 | Bitmap Index Design and Evaluation | 1998 | SIGMOD | 0.0001453376 |
| 1,365 | FITing-Tree: A Data-aware Index Structure | 2019 | SIGMOD | 0.00012379754 |
| 1,909 | BF-Tree: Approximate Tree Indexing | 2014 | VLDB | 0.00010123661 |
| 2,045 | Indexable PLA for Efficient Similarity Search | 2007 | VLDB | 9.6950855e-05 |
| 2,046 | Efficient Parallel Lists Intersection and Index Compression Algorithms using Graphics Processing Units | 2011 | VLDB | 9.6922338e-05 |
| 2,313 | Building a Bw-Tree Takes More Than Just Buzz Words | 2018 | SIGMOD | 9.0546844e-05 |
| 2,821 | An Experimental Study of Bitmap Compression vs. Inverted List Compression | 2017 | SIGMOD | 8.0639288e-05 |
| 3,482 | Optimal Column Layout for Hybrid Workloads | 2019 | VLDB | 7.0514808e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,183 | On Two-Dimensional Indexability and Optimal Range Search Indexing (Extended Abstract) | 1999 | PODS | 0.00013444058 |
| 6,226 | When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories | 2023 | SIGMOD | 5.1413982e-05 |
| 8,811 | Tuning Hierarchical Learned Indexes on Disk and Beyond | 2022 | SIGMOD | 4.4398976e-05 |
| 5,154 | Hist-Tree: Those Who Ignore It Are Doomed to Learn | 2021 | CIDR | 5.6548237e-05 |
| 1,438 | Benchmarking Learned Indexes | 2021 | VLDB | 0.00011965956 |
| 7,389 | Making In-Memory Learned Indexes Efficient on Disk | 2024 | SIGMOD | 4.7386163e-05 |
| 5,072 | Learned Index: A Comprehensive Experimental Evaluation | 2023 | VLDB | 5.7121108e-05 |
| 6,442 | Updatable Learned Indexes Meet Disk-Resident DBMS - From Evaluations to Design Choices | 2023 | SIGMOD | 5.0541252e-05 |
| 8,764 | Dynamic Indexability and Lower Bounds for Dynamic One-Dimensional Range Query Indexes | 2009 | PODS | 4.4520434e-05 |
| 9,745 | Why Are Learned Indexes So Effective but Sometimes Ineffective? | 2025 | VLDB | 4.2856385e-05 |