Steve, I'm a little lost here; Is this a replacement for M/R or is it some new code that sits ontop of M/R that runs an iteration over some sort of graph's vertexes? My quick scan of Google's article didn't seem to yeild a distinction. Either way, I'd say for our data that a graph processing lib for M/R would be interesting.
Josh Patterson TVA -----Original Message----- From: Steve Loughran [mailto:ste...@apache.org] Sent: Thursday, June 25, 2009 5:57 AM To: core-user@hadoop.apache.org Subject: Re: FYI, Large-scale graph computing at Google Edward J. Yoon wrote: > What do you think about another new computation framework on HDFS? > > On Mon, Jun 22, 2009 at 3:50 PM, Edward J. Yoon <edwardy...@apache.org> wrote: >> http://googleresearch.blogspot.com/2009/06/large-scale-graph-computing-a t-google.html >> -- It sounds like Pregel seems, a computing framework based on dynamic >> programming for the graph operations. I guess maybe they removed the >> file communications/intermediate files during iterations. >> >> Anyway, What do you think? I have a colleague (paolo) who would be interested in adding a set of graph algorithms on top of the MR engine
