EUVIMEDEUVIMED entdecken
Crossref

One Join Order Does Not Fit All: Reducing Intermediate Results with Per-Split Query Plans

Yujun He, Hangdong Zhao, Simon Frisk, Yifei Yang, Kevin Kristensen, Paraschos Koutris, Xiangyao Yu

Proceedings of the VLDB Endowment · 01.05.2026 · 19 (9) · 2045-2058

DOI: 10.14778/3819518.3819533 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the VLDB Endowment, online erschienen am 19.08.2026. Verfasst von Yujun He und 6 weiteren Autor:innen. Die Arbeit nennt 41 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Minimizing intermediate results is critical for efficient multi-join query processing. Although the seminal Yannakakis algorithm offers strong guarantees for acyclic queries, cyclic queries remain an open challenge. In this paper, we propose SplitJoin, a framework that introduces split as a first-class query operator. By partitioning input tables into heavy and light parts, SplitJoin allows different data partitions to use distinct query plans, with the goal of reducing intermediate sizes using existing binary join engines. We systematically explore the design space for split-based optimizations, including threshold selection, split strategies, and join ordering after splits. Implemented as a front-end to DuckDB and Umbra, SplitJoin achieves substantial improvements: on DuckDB, SplitJoin completes 66 social network queries (vs. 48 natively), achieving 1.8× faster runtime and 4.5× smaller intermediates on average (up to 14.8× and 74×, respectively); on Umbra, it completes 70 queries (vs. 56), achieving 1.3× speedups and 1.8× smaller intermediates on average (up to 11.6× and 33.1×, respectively).

Zitieren

APA

He, Y., Zhao, H., Frisk, S., Yang, Y., Kristensen, K., Koutris, P., & Yu, X. (2026). One Join Order Does Not Fit All: Reducing Intermediate Results with Per-Split Query Plans. Proceedings of the VLDB Endowment, 19(9), 2045-2058. https://doi.org/10.14778/3819518.3819533

Vancouver

He Y, Zhao H, Frisk S, Yang Y, Kristensen K, Koutris P, et al. One Join Order Does Not Fit All: Reducing Intermediate Results with Per-Split Query Plans. Proceedings of the VLDB Endowment. 2026;19(9):2045-2058. doi:10.14778/3819518.3819533

BibTeX
@article{He2026,
  author = {He, Yujun and Zhao, Hangdong and Frisk, Simon and Yang, Yifei and Kristensen, Kevin and Koutris, Paraschos and Yu, Xiangyao},
  title = {One Join Order Does Not Fit All: Reducing Intermediate Results with Per-Split Query Plans},
  journal = {Proceedings of the VLDB Endowment},
  year = {2026},
  volume = {19},
  number = {9},
  pages = {2045--2058},
  doi = {10.14778/3819518.3819533}
}
Kostenlos starten →