hama-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Hyunsik Choi (JIRA)" <j...@apache.org>
Subject [jira] Created: (HAMA-201) Design the storage structure for graph data
Date Fri, 16 Oct 2009 03:06:31 GMT
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
            Reporter: Hyunsik Choi

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