On 05.09.2011 06:42, Jake Mannix wrote: > One of my co-workers ran it on our > corporate Hadoop cluster this past weekend, and found it did a very fast > PageRank computation (far faster than even well-tuned M/R code on the same > data), and it worked pretty close to out-of-the box.
Could you share some more details? Which kind of implementations did he use? Power-iterations over the adjacency matrix should be the fastest way to in M/R. I'm beginning to look at Giraph (and also taking a deeper look at the Pregel paper). I think the "Vertex"-paradigm is much more intuitive and easier to use for implementing graph algorithms than plain MapReduce. So if Giraph is so much faster and at the same time easier to use, we should think about basing our graph algorithms (that are still very much in their infancy) on it, given a stable release exists. As far as I understand it, Giraph runs as a standard M/R job in Hadoop right? So there is no installation necessary in the cluster. --sebastian
