We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Computer Science & Information Technology/Graph Twiddling in a MapReduce World
PeriodicalsComputer Science & Information Technology

Graph Twiddling in a MapReduce World

Checking your access to this record.

Abstract & Overview

As the size of graphs for analysis continues to grow, methods of graph processing that scale well have become increasingly important. One way to handle large datasets is to disperse them across an array of networked computers, each of which implements simple sorting and accumulating, or MapReduce, operations. This cloud computing approach offers many attractive features. If decomposing useful graph operations in terms of MapReduce cycles is possible, it provides incentive for seriously considering cloud computing. Moreover, it offers a way to handle a large graph on a single machine that can't hold the entire graph as well as enables streaming graph processing. This article examines this possibility.

Cite this record

J. Cohen (2009). Graph Twiddling in a MapReduce World. Computing in Science & Engineering, 11(4), 29–41. https://doi.org/10.1109/mcse.2009.120

Copy in another style

Cohen, J. (2009). Graph Twiddling in a MapReduce World. Computing in Science & Engineering, 11(4), 29–41. https://doi.org/10.1109/mcse.2009.120
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.