Free Join: Unifying Worst-Case Optimal and Traditional Joins
Summary: Free Join unifies WCOJ and traditional binary joins, using WCOJ for cyclic parts and binary plans for acyclic parts. A unifying plan, a hash+trie data structure, and Rust optimizations let the system match or beat both baselines on benchmarks. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yisu Remy Wang
- 2. Max Willsey
- 3. Dan Suciu
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,465 | Robust Join Processing with Diamond Hardened Joins | 2024 | VLDB | 6.1604282e-05 |
| 5,765 | Predicate Transfer: Efficient Pre-Filtering on Multi-Join Queries | 2024 | CIDR | 5.336442e-05 |
| 7,126 | Debunking the Myth of Join Ordering: Toward Robust SQL Analytics | 2025 | SIGMOD | 4.8232367e-05 |
| 9,031 | Extending SQL to Return a Subdatabase | 2025 | SIGMOD | 4.4039656e-05 |
| 10,284 | FlowLog: Efficient and Extensible Datalog via Incrementality | 2026 | VLDB | 4.1945683e-05 |
| 10,488 | HoneyComb: A Parallel Worst-Case Optimal Join on Multicores | 2025 | SIGMOD | 4.1945683e-05 |
| 10,514 | cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns | 2025 | SIGMOD | 4.1945683e-05 |
| 10,733 | Subgraph Matching: A New Decomposition Based Approach | 2025 | VLDB | 4.1945683e-05 |
| 10,994 | Towards a Converged Relational-Graph Optimization Framework | 2024 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 16 of 16 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 | Pagerank |
|---|---|---|---|---|
| 1,619 | Adaptive Optimization of Very Large Join Queries | 2018 | SIGMOD | 0.00011111678 |
| 11,890 | Let's Rethink Join Optimization in Distributed Systems | 2015 | CIDR | 4.1945683e-05 |
| 1,333 | Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins | 2019 | VLDB | 0.00012523806 |
| 4,432 | Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins | 2016 | PODS | 6.1938383e-05 |
| 2,296 | Joins via Geometric Resolutions: Worst-case and Beyond | 2015 | PODS | 9.0776226e-05 |
| 502 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.00021526612 |
| 4,465 | Robust Join Processing with Diamond Hardened Joins | 2024 | VLDB | 6.1604282e-05 |
| 6,647 | Fast Join Project Query Evaluation using Matrix Multiplication | 2020 | SIGMOD | 4.9772122e-05 |
| 3,515 | Scalable Computation of Acyclic Joins (Extended Abstract) | 2006 | PODS | 7.0220813e-05 |
| 2,275 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB | 9.1262202e-05 |