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.1905499e-05
- Overall Rank
- 11,439 | 20.50%
- DOI
-
10.1145/3452021.3458318
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
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.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 903 |
The Design of an Acquisitional Query Processor For Sensor Networks |
2003 |
SIGMOD |
0.00015449454 |
| 1,114 |
Parallel Evaluation of Conjunctive Queries |
2011 |
PODS |
0.00013871948 |
| 1,411 |
Communication Steps for Parallel Query Processing |
2013 |
PODS |
0.00012118832 |
| 2,216 |
Skew in Parallel Query Processing |
2014 |
PODS |
9.2693784e-05 |
| 2,714 |
Minimal MapReduce Algorithms |
2013 |
SIGMOD |
8.2426646e-05 |
| 2,764 |
Parallel Data Analysis Directly on Scientific File Formats |
2014 |
SIGMOD |
8.1607305e-05 |
| 2,856 |
A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries |
2017 |
PODS |
8.0120856e-05 |
| 3,831 |
Output-optimal Parallel Algorithms for Similarity Joins |
2017 |
PODS |
6.7146681e-05 |
| 4,026 |
Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data Structures |
2016 |
PODS |
6.5166769e-05 |
| 4,709 |
Instance and Output Optimal Parallel Algorithms for Acyclic Joins |
2019 |
PODS |
5.9744219e-05 |
| 5,840 |
Topology Dependent Bounds For FAQs |
2019 |
PODS |
5.3062554e-05 |
| 8,458 |
Topology-aware Parallel Data Processing: Models, Algorithms and Systems at Scale |
2020 |
CIDR |
4.5013189e-05 |
| 9,002 |
Chasing Similarity: Distribution-aware Aggregation Scheduling |
2019 |
VLDB |
4.4077753e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 2,856 |
A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries |
2017 |
PODS |
8.0120856e-05 |
| 6,834 |
Adaptive Asynchronous Parallelization of Graph Algorithms |
2018 |
SIGMOD |
4.9072544e-05 |
| 10,929 |
Parallel Communication Obliviousness: One Round and Beyond |
2024 |
PODS |
4.1905499e-05 |
| 3,600 |
Parallel Local Graph Clustering |
2016 |
VLDB |
6.9285467e-05 |
| 4,026 |
Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data Structures |
2016 |
PODS |
6.5166769e-05 |
| 1,948 |
Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows |
2018 |
VLDB |
9.9938634e-05 |
| 4,641 |
Algorithmic Aspects of Parallel Query Processing |
2018 |
SIGMOD |
6.0215749e-05 |
| 11,634 |
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice |
2020 |
VLDB |
4.1905499e-05 |
| 10,915 |
Topology-aware Parallel Joins |
2024 |
PODS |
4.1905499e-05 |
| 8,458 |
Topology-aware Parallel Data Processing: Models, Algorithms and Systems at Scale |
2020 |
CIDR |
4.5013189e-05 |