Now showing items 1-1 of 1
Iterative Computation of Connected Graph Components with MapReduce
Datenbank-Spektrum: Vol. 14, No. 2
The use of the MapReduce framework for iterative graph algorithms is challenging. To achieve high performance it is critical to limit the amount of intermediate results as well as the number of necessary iterations. We address these issues for the important problem of finding connected components in large graphs. We ...