Can Learned Models Replace Hash Functions?
Summary: Evaluates learned models as hash functions across chaining, probing, and cuckoo hashing. They cut probe latency 1.4× and non-partitioned join time 28% on favorable distributions, but can hurt when distributions are unsuitable. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ibrahim Sabek (Massachusetts Institute of Technology)
- 2. Kapil Vaidya (Massachusetts Institute of Technology)
- 3. Dominik Horn (Technical University of Munich)
- 4. Andreas Kipf (Massachusetts Institute of Technology)
- 5. Michael Mitzenmacher (Harvard University)
- 6. Tim Kraska (Massachusetts Institute of Technology)
BibTeX Citation
@article{sabek_vldb23,
title = {{Can Learned Models Replace Hash Functions?}},
author = {Sabek, Ibrahim and Vaidya, Kapil and Horn, Dominik and Kipf, Andreas and Mitzenmacher, Michael and Kraska, Tim},
journal = {PVLDB},
series = {{VLDB} '23},
volume = {16},
number = {3},
pages = {532--545},
doi = {10.14778/3570690.3570702},
url = {https://doi.org/10.14778/3570690.3570702},
year = {2023}
}
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,792 | Learned Index: A Comprehensive Experimental Evaluation | 2023 | VLDB | 7.1220982e-05 |
| 7,287 | Is Perfect Hashing Practical for OLAP Systems? | 2024 | CIDR | 5.6544795e-05 |
| 8,234 | The Case for Learned In-Memory Joins | 2023 | VLDB | 5.460955e-05 |
| 10,262 | LINE: A Learned Index with Group-Enhanced Leaves and Cache-Optimized Inner Tree | 2026 | SIGMOD | 5.093636e-05 |
| 10,505 | The Case For Language Model Approximated LIKE Predicate | 2026 | SIGMOD | 5.093636e-05 |
| 10,624 | Learned Static Function Data Structures | 2026 | VLDB | 5.093636e-05 |
| 10,944 | Not Small Enough? SegPQ: A Learned Approach to Compress Product Quantization Codebooks | 2025 | VLDB | 5.093636e-05 |
| 11,174 | FairHash: A Fair and Memory/Time-efficient Hashmap | 2024 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 18 of 18 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 |
|---|---|---|---|---|
| 1 | 847 | Benchmarking Learned Indexes | 2021 | VLDB |
| 2 | 11,572 | New Wine in an Old Bottle: Data-Aware Hash Functions for Bloom Filters | 2022 | VLDB |
| 3 | 43 | The Case for Learned Index Structures | 2018 | SIGMOD |
| 4 | 360 | Design and Evaluation of Main Memory Hash Join Algorithms for Multi-core CPUs | 2011 | SIGMOD |
| 5 | 3,792 | Learned Index: A Comprehensive Experimental Evaluation | 2023 | VLDB |
| 6 | 8,234 | The Case for Learned In-Memory Joins | 2023 | VLDB |
| 7 | 8,232 | Adaptive Factorization Using Linear-Chained Hash Tables | 2025 | CIDR |
| 8 | 3,858 | A General and Efficient Querying Method for Learning to Hash | 2018 | SIGMOD |
| 9 | 8,880 | Entropy-Learned Hashing: Constant Time Hashing with Controllable Uniformity | 2022 | SIGMOD |
| 10 | 1,278 | A Seven-Dimensional Analysis of Hashing Methods and its Implications on Query Processing | 2016 | VLDB |