[
https://issues.apache.org/jira/browse/HAMA-201?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Edward J. Yoon resolved HAMA-201.
---------------------------------
Resolution: Won't Fix
won't fix.
> Design the storage structure for graph data
> -------------------------------------------
>
> Key: HAMA-201
> URL: https://issues.apache.org/jira/browse/HAMA-201
> Project: Hama
> Issue Type: New Feature
> Components: graph
> Affects Versions: 0.2.0
> Reporter: Hyunsik Choi
> Assignee: Hyunsik Choi
> Fix For: 0.2.0
>
>
> For graph package, we need a novel storage structure in response to our main
> objective. It can be a file structure or a storage system like Hbase.
> Its requirements are as follows:
> * It has to support random access to any vertex by a given key.
> * The key will be an array of bytes.
> * A vertex or edge has a label value composed of an array of bytes.
> * The maximum degree of a vertex can be almost infinity.
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.
