Support for Graphs with Huge adjacency lists
--------------------------------------------
Key: GIRAPH-96
URL: https://issues.apache.org/jira/browse/GIRAPH-96
Project: Giraph
Issue Type: Improvement
Reporter: Arun Suresh
Currently the vertex initialize() method is passed the complete adjacency list
as a HashMap. All the current concrete implementations of Vertex iterate over
the adjacency list and recreate new Data Structures within the Vertex instance
to hold/manipulate the adjacency list. This would seize to be feasible once the
size of the adjacency list becomes really huge.
I propose storing the adjacency list and all vertex information (and incoming
messages ?) in a distributed data store such as HBase. The adjacency list can
be lazily loaded via HBase Scans. I was thinking of an HBase schema where the
row Id is a concatenation of VertexID+OutboundVertexId with a single column
containing the edge.
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators:
https://issues.apache.org/jira/secure/ContactAdministrators!default.jspa
For more information on JIRA, see: http://www.atlassian.com/software/jira
