Communication Cost in Parallel Query Evaluation: A Tutorial
Summary: Defines the Massively Parallel Communication (MPC) model and analyzes communication for conjunctive-query evaluation on p servers using HyperCube/Shares and randomized hashing. Derives tight single-round bounds via the query hypergraph's fractional vertex cover (with skew extensions), discusses multi-round skew-handling and AGM connections; arbitrary-arity relations remain open. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Dan Suciu (University of Washington)
BibTeX Citation
@inproceedings{suciu_pods17,
address = {New York, NY, USA},
series = {{PODS} '17},
title = {{Communication Cost in Parallel Query Evaluation: A Tutorial}},
url = {https://dl.acm.org/doi/10.1145/3034786.3056449},
doi = {10.1145/3034786.3056449},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Suciu, Dan},
year = {2017}
}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 4 of 4 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,231 | Communication Steps for Parallel Query Processing | 2013 | PODS | 0.00011410373 |
| 1,481 | Skew in Parallel Query Processing | 2014 | PODS | 0.00010539119 |
| 1,545 | Upper and Lower Bounds on the Cost of a Map-Reduce Computation | 2013 | VLDB | 0.00010302384 |
| 2,043 | A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries | 2017 | PODS | 9.1406885e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,890 | Sharing Aggregate Computation for Distributed Queries | 2007 | SIGMOD |
| 2 | 9,659 | Parallel Query Processing: To Separate Communication from Computation | 2022 | SIGMOD |
| 3 | 11,493 | Parallel Communication Obliviousness: One Round and Beyond | 2024 | PODS |
| 4 | 1,292 | From Theory to Practice: Efficient Join Query Evaluation in a Parallel Database System | 2015 | SIGMOD |
| 5 | 8,614 | Parallel-Correctness and Transferability for Conjunctive Queries | 2015 | PODS |
| 6 | 977 | Parallel Evaluation of Conjunctive Queries | 2011 | PODS |
| 7 | 2,043 | A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries | 2017 | PODS |
| 8 | 1,231 | Communication Steps for Parallel Query Processing | 2013 | PODS |
| 9 | 1,481 | Skew in Parallel Query Processing | 2014 | PODS |
| 10 | 4,337 | Algorithmic Aspects of Parallel Query Processing | 2018 | SIGMOD |