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.
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 <[email protected]> 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 [email protected] http://blog.udanax.org
