Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins
Summary: Extends I/O-optimal triangle-query techniques to a broad class of acyclic joins via a multi-relation algorithm that carefully avoids materializing intermediates to disk. Proves worst-case I/O-optimality for several acyclic classes despite unknown AGM-like I/O bounds. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,856 | A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries | 2017 | PODS | 8.0120856e-05 |
| 4,709 | Instance and Output Optimal Parallel Algorithms for Acyclic Joins | 2019 | PODS | 5.9744219e-05 |
| 5,650 | Cover or Pack: New Upper and Lower Bounds for Massively Parallel Joins | 2021 | PODS | 5.3887172e-05 |
| 10,371 | Smallest Synthetic Witnesses for Conjunctive Queries | 2025 | PODS | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 503 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.00021517145 |
| 588 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00019588834 |
| 2,219 | The Input/Output Complexity of Triangle Enumeration | 2014 | PODS | 9.2653868e-05 |
| 3,519 | Scalable Computation of Acyclic Joins (Extended Abstract) | 2006 | PODS | 7.0181381e-05 |
| 4,783 | Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration | 2015 | PODS | 5.9215677e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,298 | Joins via Geometric Resolutions: Worst-case and Beyond | 2015 | PODS | 9.0746479e-05 |
| 6,699 | Maintaining Acyclic Foreign-Key Joins under Updates | 2020 | SIGMOD | 4.9534535e-05 |
| 144 | Optimization of Nonrecursive Queries | 1986 | VLDB | 0.00041430126 |
| 503 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.00021517145 |
| 8,972 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS | 4.4150824e-05 |
| 8,035 | Instance-Optimal Acyclic Join Processing Without Regret: Engineering the Yannakakis Algorithm in Column Stores | 2025 | VLDB | 4.5967078e-05 |
| 8,587 | Output-Optimal Algorithms for Join-Aggregate Queries | 2025 | PODS | 4.4853975e-05 |
| 2,281 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB | 9.122455e-05 |
| 4,709 | Instance and Output Optimal Parallel Algorithms for Acyclic Joins | 2019 | PODS | 5.9744219e-05 |
| 3,519 | Scalable Computation of Acyclic Joins (Extended Abstract) | 2006 | PODS | 7.0181381e-05 |