One Join Order Does Not Fit All: Reducing Intermediate Results with Per-Split Query Plans
Summary: SplitJoin partitions inputs into heavy/light parts and assigns each split a distinct join order, reducing intermediates for cyclic multi-joins using existing binary engines. DuckDB/Umbra experiments show up to 14.8×/11.6× speedups and 74×/33.1× smaller intermediates. (summarized by gpt-5.6-luna on Aug 17 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yujun He (Southern University of Science and Technology; University of Wisconsin)
- 2. Hangdong Zhao (Gray Systems Lab, Microsoft)
- 3. Simon Frisk (University of Wisconsin)
- 4. Yifei Yang (University of Wisconsin)
- 5. Kevin Kristensen (University of Wisconsin)
- 6. Paraschos Koutris (University of Wisconsin)
- 7. Xiangyao Yu (University of Wisconsin)
BibTeX Citation
@article{he_vldb26,
title = {{One Join Order Does Not Fit All: Reducing Intermediate Results with Per-Split Query Plans}},
author = {He, Yujun and Zhao, Hangdong and Frisk, Simon and Yang, Yifei and Kristensen, Kevin and Koutris, Paraschos and Yu, Xiangyao},
journal = {PVLDB},
series = {{VLDB} '26},
volume = {19},
number = {9},
pages = {2045--2058},
doi = {10.14778/3819518.3819533},
url = {https://doi.org/10.14778/3819518.3819533},
year = {2026}
}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 23 of 23 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 | 7,774 | Adaptive Factorization Using Linear-Chained Hash Tables | 2025 | CIDR |
| 2 | 7,348 | A Scalable and Generic Approach to Range Joins | 2022 | VLDB |
| 3 | 3,153 | Robust Join Processing with Diamond Hardened Joins | 2024 | VLDB |
| 4 | 1,596 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB |
| 5 | 7,435 | Efficient Computation of Quantiles over Joins | 2023 | PODS |
| 6 | 6,805 | Instance-Optimal Acyclic Join Processing Without Regret: Engineering the Yannakakis Algorithm in Column Stores | 2025 | VLDB |
| 7 | 4,950 | Debunking the Myth of Join Ordering: Toward Robust SQL Analytics | 2025 | SIGMOD |
| 8 | 8,164 | Efficient Query Re-optimization with Judicious Subquery Selections | 2023 | SIGMOD |
| 9 | 3,660 | Scalable Computation of Acyclic Joins (Extended Abstract) | 2006 | PODS |
| 10 | 9,566 | Saving Private Hash Join | 2025 | VLDB |