The Case for Learned In-Memory Joins
Summary: Explores CDF-based learned indexes (RMI, RadixSpline) for in-memory indexed nested-loop, sort, and hash joins. Optimized learned variants outperform state-of-the-art joins across diverse datasets and workloads. (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. Tim Kraska (Massachusetts Institute of Technology)
BibTeX Citation
@article{sabek_vldb23,
title = {{The Case for Learned In-Memory Joins}},
author = {Sabek, Ibrahim and Kraska, Tim},
journal = {PVLDB},
series = {{VLDB} '23},
volume = {16},
number = {7},
pages = {1749--1762},
doi = {10.14778/3587136.3587148},
url = {https://doi.org/10.14778/3587136.3587148},
year = {2023}
}
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,846 | The Holon Approach for Simultaneously Tuning Multiple Components in a Self-Driving Database Management System with Machine Learning via Synthesized Proto-Actions | 2024 | VLDB | 5.5331459e-05 |
| 9,465 | Are Joins over LSM-trees Ready? Take RocksDB as an Example | 2025 | VLDB | 5.2634238e-05 |
| 10,506 | This is Going to Sound Crazy, But What If We Used Large Language Models to Boost Automatic Database Tuning Algorithms By Leveraging Prior History? We Will Find Better Configurations More Quickly Than Retraining From Scratch! | 2026 | SIGMOD | 5.093636e-05 |
| 10,955 | DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees | 2025 | VLDB | 5.093636e-05 |
| 11,204 | SPID-Join: A Skew-resistant Processing-in-DIMM Join Algorithm Exploiting the Bank- and Rank-level Parallelisms of DIMMs | 2024 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 35 of 35 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 | 3,011 | Design and Evaluation of Parallel Pipelined Join Algorithms | 1987 | SIGMOD |
| 2 | 4,780 | Can Learned Models Replace Hash Functions? | 2023 | VLDB |
| 3 | 252 | Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited | 2014 | VLDB |
| 4 | 3,255 | Processing Sliding Window Multi-Joins in Continuous Queries over Data Streams | 2003 | VLDB |
| 5 | 8,468 | Making RDBMSs Efficient on Graph Workloads Through Predefined Joins | 2022 | VLDB |
| 6 | 5,812 | MCJoin: A Memory-Constrained Join for Column-Store Main-Memory Databases. | 2012 | SIGMOD |
| 7 | 1,740 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB |
| 8 | 360 | Design and Evaluation of Main Memory Hash Join Algorithms for Multi-core CPUs | 2011 | SIGMOD |
| 9 | 1,265 | An Experimental Comparison of Thirteen Relational Equi-Joins in Main Memory | 2016 | SIGMOD |
| 10 | 959 | Memory-Efficient Hash Joins | 2015 | VLDB |