DBScholar

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
10882
Venue
VLDB
Year
2013
Pagerank
0.00010527649
Overall Rank
1,514 | 89.62%
DOI
10.14778/2535573.2535574

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{afrati_vldb13,
        title = {{Upper and Lower Bounds on the Cost of a Map-Reduce Computation}},
        author = {Afrati, Foto N. and Sarma, Anish Das and Salihoglu, Semih and Ullman, Jeffrey D.},
        journal = {PVLDB},
        series = {{VLDB} '13},
        volume = {6},
        number = {4},
        pages = {277--288},
        doi = {10.14778/2535573.2535574},
        url = {https://doi.org/10.14778/2535573.2535574},
        year = {2013}
}

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