hama-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "David Greco (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (HAMA-359) Development of Shortest Path Finding Algorithm
Date Fri, 25 Mar 2011 10:21:05 GMT

    [ https://issues.apache.org/jira/browse/HAMA-359?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13011151#comment-13011151

David Greco commented on HAMA-359:

Hey guys,
just to pointed out that I'm not part of the tinkerpop team. I decided to use their very nice
apis to drive my development effort. I think I found a way for laying out a graph on top of
an HBase table. I tried to make all the graph accesses only based on accessing a single HBase
row, since updating an hbase row is atomic in this way I can make accessing/modifying graph
vertexes, nodes (almost) atomic.
Than, given the fact that Hbase supports M/R, I'd like to implement some M/R graph algorithm
to see how it goes.
Please, feel free to contact me for questions/suggestions.

> 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

View raw message