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
BibTeX Citation
@inproceedings{hu_pods16,
address = {New York, NY, USA},
series = {{PODS} '16},
title = {{Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins}},
url = {https://dl.acm.org/doi/10.1145/2902251.2902292},
doi = {10.1145/2902251.2902292},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Hu, Xiao and Yi, Ke},
year = {2016}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 318 | Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems | 2018 | PODS | 0.00021178303 |
| 2,052 | A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries | 2017 | PODS | 9.1064522e-05 |
| 4,487 | Instance and Output Optimal Parallel Algorithms for Acyclic Joins | 2019 | PODS | 6.5628751e-05 |
| 5,610 | Cover or Pack: New Upper and Lower Bounds for Massively Parallel Joins | 2021 | PODS | 6.0498245e-05 |
| 11,165 | Smallest Synthetic Witnesses for Conjunctive Queries | 2025 | PODS | 4.9605343e-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 |
|---|---|---|---|---|
| 397 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.0001911958 |
| 599 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00015700433 |
| 2,229 | The Input/Output Complexity of Triangle Enumeration | 2014 | PODS | 8.7890942e-05 |
| 3,662 | Scalable Computation of Acyclic Joins (Extended Abstract) | 2006 | PODS | 7.1009211e-05 |
| 5,093 | Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration | 2015 | PODS | 6.2653284e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 144 | Optimization of Nonrecursive Queries | 1986 | VLDB |
| 2 | 11,097 | Instance-Optimal Acyclic Joins: From Theory to Systems | 2026 | VLDB |
| 3 | 397 | Worst-case Optimal Join Algorithms | 2012 | PODS |
| 4 | 6,482 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS |
| 5 | 318 | Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems | 2018 | PODS |
| 6 | 6,826 | Instance-Optimal Acyclic Join Processing Without Regret: Engineering the Yannakakis Algorithm in Column Stores | 2025 | VLDB |
| 7 | 6,585 | Output-Optimal Algorithms for Join-Aggregate Queries | 2025 | PODS |
| 8 | 1,603 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB |
| 9 | 4,487 | Instance and Output Optimal Parallel Algorithms for Acyclic Joins | 2019 | PODS |
| 10 | 3,662 | Scalable Computation of Acyclic Joins (Extended Abstract) | 2006 | PODS |