hama-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Amandeep Khurana <ama...@gmail.com>
Subject Re: Schema to store graph
Date Tue, 31 Mar 2009 09:04:09 GMT
Response below


Amandeep Khurana
Computer Science Graduate Student
University of California, Santa Cruz


On Tue, Mar 31, 2009 at 1:58 AM, Edward J. Yoon <edwardyoon@apache.org>wrote:

> Hama store the sparse graph using Hbase as an sparse adjacency matrix.
> One of reason is to perform matrix decomposition for large sparse
> graphs. Anyway, I guess If you store the graph like that, you'll only
> need update the row 'v/w' to add v to w's/w to v's list of neighbors.


I didnt quite understand the last line here.

I did think of a sparse matrix as well but not sure which is a better
approach. Thats why I posted here...

Share about your experiences with Hama...

>
>
> Just FYI, You also may want to see --
> http://blog.udanax.org/2009/02/breadth-first-search-mapreduce.html
>
> If you have any advice for us, Pls let us know.
>
> On Tue, Mar 31, 2009 at 5:09 PM, Amandeep Khurana <amansk@gmail.com>
> wrote:
> > What would be a good schema in HBase to store information pertaining to a
> > many to many graph? I was thinking of having the node id as the row key,
> the
> > type of relation as the column family, the relation name for the column
> > identifier and the actual cell containing the key of the node that is
> being
> > connected with.
> >
> >
> > Amandeep Khurana
> > Computer Science Graduate Student
> > University of California, Santa Cruz
> >
>
>
>
> --
> Best Regards, Edward J. Yoon
> edwardyoon@apache.org
> http://blog.udanax.org
>

Mime
  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message