Two-Attribute Skew Free, Isolated CP Theorem, and Massively Parallel Joins
Summary: Presents an MPC algorithm for multi-way joins with per-machine load O~(n / p^{2/(α·φ)}), introducing φ, a generalized vertex-packing number that captures instance complexity. Key contributions: a two-attribute skew-free partitioning for parallel joins and an isolated Cartesian-product theorem generalizing α=2 results to α≥3. (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
BibTeX Citation
@inproceedings{qiao_pods21,
address = {New York, NY, USA},
series = {{PODS} '21},
title = {{Two-Attribute Skew Free, Isolated CP Theorem, and Massively Parallel Joins}},
url = {https://dl.acm.org/doi/10.1145/3452021.3458321},
doi = {10.1145/3452021.3458321},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Qiao, Miao and Tao, Yufei},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,145 | Parallel Communication Obliviousness: One Round and Beyond | 2024 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 120 | HadoopDB: An Architectural Hybrid of MapReduce and DBMS Technologies for Analytical Workloads | 2009 | VLDB | 0.00031680027 |
| 321 | Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems | 2018 | PODS | 0.00021283186 |
| 954 | Parallel Evaluation of Conjunctive Queries | 2011 | PODS | 0.00012997301 |
| 1,448 | Skew in Parallel Query Processing | 2014 | PODS | 0.00010758872 |
| 1,998 | A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries | 2017 | PODS | 9.3363505e-05 |
| 2,183 | The Input/Output Complexity of Triangle Enumeration | 2014 | PODS | 9.0066814e-05 |
| 2,462 | Output-optimal Parallel Algorithms for Similarity Joins | 2017 | PODS | 8.5487602e-05 |
| 4,371 | Instance and Output Optimal Parallel Algorithms for Acyclic Joins | 2019 | PODS | 6.738679e-05 |
| 4,949 | Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration | 2015 | PODS | 6.4314032e-05 |
| 5,463 | Cover or Pack: New Upper and Lower Bounds for Massively Parallel Joins | 2021 | PODS | 6.2086169e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 423 | Massively Parallel Sort-Merge Joins in Main Memory Multi-Core Database Systems | 2012 | VLDB |
| 2 | 1,448 | Skew in Parallel Query Processing | 2014 | PODS |
| 3 | 3,617 | Scalable Computation of Acyclic Joins (Extended Abstract) | 2006 | PODS |
| 4 | 7,111 | Submodularity of Distributed Join Computation | 2018 | SIGMOD |
| 5 | 4,244 | Algorithmic Aspects of Parallel Query Processing | 2018 | SIGMOD |
| 6 | 11,145 | Parallel Communication Obliviousness: One Round and Beyond | 2024 | PODS |
| 7 | 4,371 | Instance and Output Optimal Parallel Algorithms for Acyclic Joins | 2019 | PODS |
| 8 | 11,132 | Topology-aware Parallel Joins | 2024 | PODS |
| 9 | 7,143 | Parallel Algorithms for Sparse Matrix Multiplication and Join-Aggregate Queries | 2020 | PODS |
| 10 | 5,463 | Cover or Pack: New Upper and Lower Bounds for Massively Parallel Joins | 2021 | PODS |