Database Paper Browser

Back to papers

Topology-aware Parallel Joins

Summary: Topology-aware parallel join over a directed-graph network; edge costs depend on data moved and link bandwidth, with synchronous rounds and per-round cost = maximum edge cost. An asymptotically optimal binary-join algorithm for symmetric tree topologies, extending topology-aware protocols from set intersection and Cartesian product to skewed inputs. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
1928
Venue
PODS
Year
2024
Pagerank
4.1945683e-05
Overall Rank
10,911 | 24.10%
DOI
10.1145/3651598

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 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