To be honest, I was thought the BigTable (HBase) for the map/reduce based graph/matrix operations. The main problems of performance were the sequential algorithm, the cost for MR job building in iterations. and, the locality of adjacent components. As mentioned on Pregel, If some algorithm requires small resources to get result, the BSP model based another computing framework on HDFS can be useful for us.
On Fri, Jun 26, 2009 at 3:37 AM, Amandeep Khurana<ama...@gmail.com> wrote: > I've been working on some graph stuff using MR as well. I'd be more than > interested to chip in as well.. > > I remember exchanging a few mails with Paolo about having an RDF store over > HBase and developing graph algorithms over it. > > > Amandeep Khurana > Computer Science Graduate Student > University of California, Santa Cruz > > > On Thu, Jun 25, 2009 at 2:57 AM, Steve Loughran <ste...@apache.org> wrote: > >> 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-at-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 >> > -- Best Regards, Edward J. Yoon @ NHN, corp. edwardy...@apache.org http://blog.udanax.org
