Instance-Optimal Acyclic Join Processing Without Regret: Engineering the Yannakakis Algorithm in Column Stores
Summary: SYA converts binary join plans into 2-phase Nested Semijoin Algebra (Lookup/Expand) plans and evaluates them by shredding in column stores to attain instance-optimal acyclic join evaluation. Provably avoids blowups and is no-regret vs binary plans; on 1,849 queries it speeds 85.3% up to 62.5x. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Liese Bekkers (Hasselt University)
- 2. Frank Neven (Hasselt University)
- 3. Stijn Vansummeren (Hasselt University)
- 4. Yisu Remy Wang (University of California Los Angeles)
BibTeX Citation
@article{bekkers_vldb25,
title = {{Instance-Optimal Acyclic Join Processing Without Regret: Engineering the Yannakakis Algorithm in Column Stores}},
author = {Bekkers, Liese and Neven, Frank and Vansummeren, Stijn and Wang, Yisu Remy},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {8},
pages = {2413--2426},
doi = {10.14778/3742728.3742737},
url = {https://doi.org/10.14778/3742728.3742737},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,895 | Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees | 2025 | SIGMOD | 5.9534254e-05 |
| 6,576 | Output-Optimal Algorithms for Join-Aggregate Queries | 2025 | PODS | 5.7428578e-05 |
| 7,810 | Parachute: Single-Pass Bi-Directional Information Passing | 2025 | VLDB | 5.4477354e-05 |
| 9,642 | Poisson Sampling over Acyclic Joins | 2026 | SIGMOD | 5.1445295e-05 |
| 10,107 | Still Asking: How Good Are Query Optimizers, Really? | 2025 | VLDB | 5.0765311e-05 |
| 10,519 | Succinct Structure Representations for Efficient Query Optimization | 2026 | SIGMOD | 4.9769913e-05 |
| 10,852 | The Data World Is Not Flat: Efficient Factorized Execution for Relational Systems | 2026 | VLDB | 4.9769913e-05 |
| 10,950 | Ultron: History-Based Query Optimization at Databricks | 2026 | VLDB | 4.9769913e-05 |
| 11,036 | Instance-Optimal Acyclic Joins: From Theory to Systems | 2026 | VLDB | 4.9769913e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 21 of 21 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 | 1,596 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB |
| 2 | 813 | The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates | 2017 | SIGMOD |
| 3 | 10,778 | One Join Order Does Not Fit All: Reducing Intermediate Results with Per-Split Query Plans | 2026 | VLDB |
| 4 | 3,661 | Scalable Computation of Acyclic Joins (Extended Abstract) | 2006 | PODS |
| 5 | 5,895 | Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees | 2025 | SIGMOD |
| 6 | 6,469 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS |
| 7 | 6,576 | Output-Optimal Algorithms for Join-Aggregate Queries | 2025 | PODS |
| 8 | 11,036 | Instance-Optimal Acyclic Joins: From Theory to Systems | 2026 | VLDB |
| 9 | 4,466 | Instance and Output Optimal Parallel Algorithms for Acyclic Joins | 2019 | PODS |
| 10 | 4,477 | Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins | 2016 | PODS |