The Case for Learned In-Memory Joins
Ibrahim Sabek, Tim Kraska
Abstract
In-memory join is an essential operator in any database engine. It has been extensively investigated in the database literature. In this paper, we study whether exploiting the CDF-based learned models to boost the join performance is practical. To the best of our knowledge, we are the first to fill this gap. We investigate the usage of CDF-based models and learned indexes (e.g., Recursive Model Index (RMI) and RadixSpline) in the three join categories; indexed nested loop join (INLJ), sort-based joins (SJ) and hash-based joins (HJ). Our study shows that there is room to improve the performance of the three join categories through our proposed optimized learned variants. Our experimental analysis showed that these optimized learned variants outperform the state-of-the-art techniques in many scenarios and with different datasets.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext aa2618a6-c310-4d94-9e91-d3ed47c0b962Cited by top-tier papers6
- The Holon Approach for Simultaneously Tuning Multiple Components in a Self-Driving Database Management System with Machine Learning via Synthesized Proto-ActionsWilliam Zhang, Wan Shen Lim, Matthew Butrovich, Andrew PavloVLDB 2024 · 13 citations
- 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!William Zhang, Wan Shen Lim, Andrew PavloSIGMOD 2026 · 7 citations
- DeepMapping: Learned Data Mapping for Lossless Compression and Efficient LookupLixi Zhou, K. Selçuk Candan, Jia ZouICDE 2024 · 6 citations
- DobLIX: A Dual-Objective Learned Index for Log-Structured Merge TreesAlireza Heidari, Amirhossein Ahmadi, Wei ZhangVLDB 2025 · 4 citations
- Are Joins over LSM-trees Ready: Take RocksDB as an ExampleWeiping Yu, Fan Wang, Xuwei Zhang, Siqiang LuoVLDB 2025 · 2 citations
Builds on11
- ALEX: An Updatable Adaptive Learned IndexJialin Ding, Umar Farooq Minhas, Jia Yu, Chi Wang et al.SIGMOD 2020 · 274 citations
- Benchmarking Learned IndexesRyan Marcus, Andreas Kipf, Alexander van Renen, Mihail Stoian et al.VLDB 2021 · 185 citations
- Learning Multi-Dimensional IndexesVikram Nathan, Jialin Ding, Mohammad Alizadeh, Tim KraskaSIGMOD 2020 · 180 citations
- Tsunami: A Learned Multi-dimensional Index for Correlated Data and Skewed WorkloadsJialin Ding, Vikram Nathan, Mohammad Alizadeh, Tim KraskaVLDB 2021 · 178 citations
- The PGM-index: a fully-dynamic compressed learned index with provable worst-case boundsPaolo Ferragina, Giorgio VinciguerraVLDB 2020 · 178 citations
Related papers
- Can Learned Models Replace Hash Functions?Ibrahim Sabek, Kapil Vaidya, Dominik Horn, Andreas Kipf et al.VLDB 2023 · 29 citations
- The Case for a Learned Sorting AlgorithmAni Kristo, Kapil Vaidya, Ugur Çetintemel, Sanchit Misra et al.SIGMOD 2020 · 47 citations
- CARMI: A Cache-Aware Learned Index with a Cost-based Construction AlgorithmJiaoyi Zhang, Yihan GaoVLDB 2022 · 42 citations
- HIRE: A Hybrid Learned Index for Robust and Efficient Performance under Mixed WorkloadsXinyi Zhang, Liang Liang, Anastasia Ailamaki, Jianliang XuSIGMOD 2026 · 2 citations
- The Price of Tailoring the Index to Your Data: Poisoning Attacks on Learned Index StructuresEvgenios M. Kornaropoulos, Silei Ren, Roberto TamassiaSIGMOD 2022 · 13 citations
