Database Paper Browser

Back to papers

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)

Paper ID
1687
Venue
PODS
Year
2016
Pagerank
6.1938383e-05
Overall Rank
4,432 | 69.17%
DOI
10.1145/2902251.2902292

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

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
502 Worst-case Optimal Join Algorithms 2012 PODS 0.00021526612
589 Massive Graph Triangulation 2013 SIGMOD 0.00019576567
2,215 The Input/Output Complexity of Triangle Enumeration 2014 PODS 9.2717602e-05
3,515 Scalable Computation of Acyclic Joins (Extended Abstract) 2006 PODS 7.0220813e-05
4,779 Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration 2015 PODS 5.9271735e-05
Previous Page 1 / 1 Next

Semantically Similar Papers