Scalable Computation of Acyclic Joins (Extended Abstract)
Summary: Computes acyclic joins of k fully-reduced relations in O(sort(n+z)) I/Os for a broad class of acyclic graphs, eliminating prior Ω((n+z)k) dependence on k and matching reducer+sort cost. Uses subset-size estimates to place tuples (avoids binary decomposition) and gives a 3-cycle bound O(n^2/m+sort(n+z)). (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Anna Pagh (IT University of Copenhagen)
- 2. Rasmus Pagh (IT University of Copenhagen)
BibTeX Citation
@inproceedings{pagh_pods06,
address = {New York, NY, USA},
series = {{PODS} '06},
title = {{Scalable Computation of Acyclic Joins (Extended Abstract)}},
url = {https://dl.acm.org/doi/10.1145/1142351.1142384},
doi = {10.1145/1142351.1142384},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Pagh, Anna and Pagh, Rasmus},
year = {2006}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 402 | Worst-case Optimal Join Algorithms | 2012 | PODS | 0.00019104625 |
| 1,725 | Beyond Worst-case Analysis for Joins with Minesweeper | 2014 | PODS | 9.7902443e-05 |
| 2,160 | DIFF: A Relational Interface for Large-Scale Data Explanation | 2019 | VLDB | 8.9364035e-05 |
| 2,166 | Subgraph Matching: on Compression and Computation | 2018 | VLDB | 8.9334874e-05 |
| 4,475 | Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins | 2016 | PODS | 6.5838041e-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 |
|---|---|---|---|---|
| 1 | Access Path Selection in a Relational Database Management System | 1979 | SIGMOD | 0.0023947656 |
| 91 | On the Propagation of Errors in the Size of Join Results | 1991 | SIGMOD | 0.0003475226 |
| 725 | Left-Deep Vs. Bushy Trees: An Analysis Of Strategy Spaces And Its Implications For Query Optimization | 1991 | SIGMOD | 0.00014465736 |
| 842 | Processing Complex Aggregate Queries over Data Streams | 2002 | SIGMOD | 0.00013540697 |
| 7,592 | XQuery Optimization | 2003 | VLDB | 5.4880486e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,292 | From Theory to Practice: Efficient Join Query Evaluation in a Parallel Database System | 2015 | SIGMOD |
| 2 | 7,609 | Computing Complex Temporal Join Queries Efficiently | 2022 | SIGMOD |
| 3 | 3,494 | On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms | 2023 | PODS |
| 4 | 1,186 | Adaptive Optimization of Very Large Join Queries | 2018 | SIGMOD |
| 5 | 7,435 | Efficient Computation of Quantiles over Joins | 2023 | PODS |
| 6 | 8,570 | On the Cyclic to Acyclic Scheme Transformation and Solving Cyclic Queries (Extended Abstract) | 1984 | PODS |
| 7 | 1,514 | Computing Joins Of Relations | 1975 | SIGMOD |
| 8 | 4,463 | Instance and Output Optimal Parallel Algorithms for Acyclic Joins | 2019 | PODS |
| 9 | 1,596 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB |
| 10 | 4,475 | Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins | 2016 | PODS |