hama-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Edward J. Yoon (JIRA)" <j...@apache.org>
Subject [jira] Commented: (HAMA-201) Design the storage structure for graph data
Date Wed, 21 Oct 2009 01:29:59 GMT

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

Edward J. Yoon commented on HAMA-201:

If we could reduce code complexity by using hbase, I'm fine.

> 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.

View raw message