Learned Static Function Data Structures
Summary: Learned static functions: ML predicts per-key value distributions, then encodes each value with a key-specific prefix code stored in a static function structure. Breaks the zero-order entropy barrier for point queries, yielding major space savings over compressed static functions. (summarized by gpt-5.4-mini on Apr 12 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 102 | The Case for Learned Index Structures | 2018 | SIGMOD | 0.00049545203 |
| 857 | The PGM-index: a fully-dynamic compressed learned index with provable worst-case bounds | 2020 | VLDB | 0.00015882892 |
| 2,051 | Efficient Parallel Lists Intersection and Index Compression Algorithms using Graphics Processing Units | 2011 | VLDB | 9.686731e-05 |
| 2,908 | SPARTAN: A Model-Based Semantic Compression System for Massive Data Tables | 2001 | SIGMOD | 7.9306333e-05 |
| 3,416 | LeCo: Lightweight Compression via Learning Serial Correlations | 2024 | SIGMOD | 7.1196234e-05 |
| 3,745 | DeepSqueeze: Deep Semantic Compression for Tabular Data | 2020 | SIGMOD | 6.7926132e-05 |
| 5,314 | Can Learned Models Replace Hash Functions? | 2023 | VLDB | 5.5724608e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,446 | Stable Learned Bloom Filters for Data Streams | 2020 | VLDB | 6.1800659e-05 |
| 9,408 | Experimental Analysis of Large-scale Learnable Vector Storage Compression | 2024 | VLDB | 4.3441378e-05 |
| 4,994 | Stacked Filters: Learning to Filter by Structure | 2021 | VLDB | 5.78027e-05 |
| 4,609 | A General and Efficient Querying Method for Learning to Hash | 2018 | SIGMOD | 6.0528541e-05 |
| 7,522 | Efficient and Tunable Similar Set Retrieval | 2001 | SIGMOD | 4.7180617e-05 |
| 102 | The Case for Learned Index Structures | 2018 | SIGMOD | 0.00049545203 |
| 11,374 | New Wine in an Old Bottle: Data-Aware Hash Functions for Bloom Filters | 2022 | VLDB | 4.1945683e-05 |
| 5,314 | Can Learned Models Replace Hash Functions? | 2023 | VLDB | 5.5724608e-05 |
| 11,445 | Learning Algorithms for Automatic Data Structure Design | 2021 | SIGMOD | 4.1945683e-05 |
| 8,720 | Entropy-Learned Hashing: Constant Time Hashing with Controllable Uniformity | 2022 | SIGMOD | 4.4609699e-05 |