You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@hama.apache.org by "Tommaso Teofili (JIRA)" <ji...@apache.org> on 2013/07/21 13:54:48 UTC
[jira] [Commented] (HAMA-783) Efficient InMemory Storage for
Vertices
[ https://issues.apache.org/jira/browse/HAMA-783?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13714686#comment-13714686 ]
Tommaso Teofili commented on HAMA-783:
--------------------------------------
I agree vertices storage should be redesigned.
A couple of highly generic comments: in memory impl should be more efficient for sure, a _GraphJobRunner_ reference shouldn't be hold by a _Vertex_ as it'd have to be serialized together with the vertex itself (in DM impl it's currently kept out of the serialization and put back then on deserialization).
> Efficient InMemory Storage for Vertices
> ---------------------------------------
>
> Key: HAMA-783
> URL: https://issues.apache.org/jira/browse/HAMA-783
> Project: Hama
> Issue Type: Improvement
> Components: graph
> Reporter: Edward J. Yoon
> Fix For: 0.7.0
>
>
> Currently there are ListVerticesInfo, DiskVerticesInfo and DirectMemory, but I personally think we have to do a big re-design of the vertices storage and graph job runner.
> Actually, the size of split is not so great. Maybe, 60 ~ 200MB. Hence, I don't think DiskVerticesInfo will be really helpful. Instead, we can use the Serialization like Spark.
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see: http://www.atlassian.com/software/jira