Database Paper Browser

Back to papers

Upper and Lower Bounds on the Cost of a Map-Reduce Computation

Summary: Presents a single-round MapReduce model with a generic lower-bound recipe tying reducer fan-in to total communication for non-embarrassingly parallel tasks. Applies it to Hamming distance 1, triangles, and matrix multiplication, delivering tight upper/lower bounds and showing two-round schemes cannot beat the best one-round bound for a fixed reducer size. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10694
Venue
VLDB
Year
2013
Pagerank
0.00012661651
Overall Rank
1,308 | 90.91%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 15 of 15 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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

Overall Rank Paper Year Venue Pagerank
868 Profiling, What-if Analysis, and Cost-based Optimization of MapReduce Programs 2011 VLDB 0.00015789681
11,630 Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice 2020 VLDB 4.1945683e-05
10,925 Parallel Communication Obliviousness: One Round and Beyond 2024 PODS 4.1945683e-05
2,212 Skew in Parallel Query Processing 2014 PODS 9.2771827e-05
3,129 Scalable Big Graph Processing in MapReduce 2014 SIGMOD 7.5008242e-05
11,976 Anti-Combining for MapReduce 2014 SIGMOD 4.1945683e-05
13,380 Job Scheduling with Minimizing Data Communication Costs 2015 SIGMOD -
1,615 The Performance of MapReduce: An In-depth Study 2010 VLDB 0.00011132319
3,703 Multi-Query Optimization in MapReduce Framework 2014 VLDB 6.8289978e-05
2,674 Minimal MapReduce Algorithms 2013 SIGMOD 8.3328645e-05