23 citations · 65 across the 8 of their papers we have counts for
3 papers · 1 filter
Upper and Lower Bounds on the Cost of a Map-Reduce Computation
Foto N. Afrati, Anish Das Sarma, Semih Salihoglu +1
In this paper we study the tradeoff between parallelism and communication cost in a map-reduce computation. For any problem that is not "embarrassingly parallel," the finer we part…
Vision Paper: Towards an Understanding of the Limits of Map-Reduce Computation
Foto N. Afrati, Anish Das Sarma, Semih Salihoglu +1
A significant amount of recent research work has addressed the problem of solving various data management problems in the cloud. The major algorithmic challenges in map-reduce comp…
Finding Connected Components on Map-reduce in Logarithmic Rounds
Vibhor Rastogi, Ashwin Machanavajjhala, Laukik Chitnis +1
Given a large graph G = (V,E) with millions of nodes and edges, how do we compute its connected components efficiently? Recent work addresses this problem in map-reduce, where a fu…