Database Paper Browser

Back to papers

The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication

Summary: Characterizes randomized communication complexity of distributed set-joins (intersection, disjointness, equality, threshold), yielding quantitative separations and consequences for distributed natural joins and join-size estimation. Provides sparse-output algorithms via BMM that improve O~(k n) and give transitive closure in O~(k^{3/2}) (O~(n^{3/2}) if k=O(n)). (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1664
Venue
PODS
Year
2015
Pagerank
5.2796864e-05
Overall Rank
5,902 | 58.95%
DOI
10.1145/2745754.2745779

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
6,418 An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems 2016 PODS 5.0696932e-05
7,504 Space Lower Bounds for Itemset Frequency Sketches 2016 PODS 4.7180617e-05
7,949 Efficient Matrix Sketching over Distributed Data 2017 PODS 4.613363e-05
8,599 Bias-Aware Sketches 2017 VLDB 4.4879268e-05
9,744 Output-Sensitive Evaluation of Regular Path Queries 2025 PODS 4.2897489e-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