Database Paper Browser

Back to papers

Cover or Pack: New Upper and Lower Bounds for Massively Parallel Joins

Summary: Instance-dependent MPC algorithm for α-acyclic joins with closed-form worst-case load (bounded relation sizes) characterized by the fractional edge covering number and shown worst-case optimal. For certain cyclic joins, prove strictly higher MPC lower bounds via the fractional edge packing number that match algorithms, revealing a separation from RAM/AGM-based bounds. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1814
Venue
PODS
Year
2021
Pagerank
5.393897e-05
Overall Rank
5,639 | 60.78%
DOI
10.1145/3452021.3458319

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank Citing Paper Year Venue Pagerank
7,017 Query Evaluation by Circuits 2022 PODS 4.8603097e-05
8,589 Output-Optimal Algorithms for Join-Aggregate Queries 2025 PODS 4.4897014e-05
10,488 HoneyComb: A Parallel Worst-Case Optimal Join on Multicores 2025 SIGMOD 4.1945683e-05
10,544 Jodes: Efficient Oblivious Join in the Distributed Setting 2025 VLDB 4.1945683e-05
10,911 Topology-aware Parallel Joins 2024 PODS 4.1945683e-05
10,925 Parallel Communication Obliviousness: One Round and Beyond 2024 PODS 4.1945683e-05
11,437 Two-Attribute Skew Free, Isolated CP Theorem, and Massively Parallel Joins 2021 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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