[
https://issues.apache.org/jira/browse/HAMA-359?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13012643#comment-13012643
]
David Greco commented on HAMA-359:
----------------------------------
Actually, graphbase is using an hbase table as an adjacency matrix. I put a row
per vertex and all the edges ids are just qualifier for the column family where
the cell value is the in-vertex id. In the same row I'm also putting the vertex
property and the edges properties. I'm just using the convention to store the
edge properties on the row corresponding to the out vertex. I tried to put as
much as possible everything in one table per graph, and also being able to do
update the graph information updating maximum two rows. Sorry, I didn't have
time to put too much information on the github site, this is something I'd like
to sort out soon.
> Development of Shortest Path Finding Algorithm
> ----------------------------------------------
>
> Key: HAMA-359
> URL: https://issues.apache.org/jira/browse/HAMA-359
> Project: Hama
> Issue Type: New Feature
> Components: examples
> Affects Versions: 0.2.0
> Reporter: Edward J. Yoon
> Labels: gsoc, gsoc2011, mentor
> Fix For: 0.3.0
>
> Original Estimate: 2016h
> Remaining Estimate: 2016h
>
> The goal of this project is development of parallel algorithm for finding a
> Shortest Path using Hama BSP.
--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira
