[jira] [Resolved] (GIRAPH-96) Support for Graphs with Huge adjacency lists

["Dionysios Logothetis (Jira)" <ji...@apache.org>]

     [ https://issues.apache.org/jira/browse/GIRAPH-96?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Dionysios Logothetis resolved GIRAPH-96.
----------------------------------------
    Resolution: Fixed

> Support for Graphs with Huge adjacency lists
> --------------------------------------------
>
>                 Key: GIRAPH-96
>                 URL: https://issues.apache.org/jira/browse/GIRAPH-96
>             Project: Giraph
>          Issue Type: Improvement
>          Components: bsp
>    Affects Versions: 0.1.0
>            Reporter: UNUSED
>            Priority: Major
>
> 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 was sent by Atlassian Jira
(v8.3.4#803005)