[
https://issues.apache.org/jira/browse/HAMA-359?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13011165#comment-13011165
]
Edward J. Yoon commented on HAMA-359:
-------------------------------------
I think, the best-fit structure for HBase table, is a adjacency matrix. Google
also stores "web link graph" to BigTable using an adjacency matrix. If you want
to use HBase, you can simply do it.
I looked at the graph-hbase, but it's just a graph-friendly API layer on top of
HBase. It'll make you feel complex.
> 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
