Database Paper Browser

Back to papers

Algorithms for a Topology-aware Massively Parallel Computation Model

Summary: Tight lower/upper bounds for set intersection, Cartesian product, and sorting in a topology-aware MPC model that assigns data-dependent costs to edges and measures round cost by the max edge. Focus on tree topologies; algorithms optimal w.r.t. initial data placement, constant-round and simple. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1813
Venue
PODS
Year
2021
Pagerank
4.1945683e-05
Overall Rank
11,436 | 20.45%
DOI
10.1145/3452021.3458318

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 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,911 Topology-aware Parallel Joins 2024 PODS 4.1945683e-05
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