Details
-
New Feature
-
Status: Resolved
-
Major
-
Resolution: Fixed
-
None
-
None
-
None
Description
Loading vertices from an HTable would be an option.
A possible schema for storing the graph would be Hexastore (http://www.vldb.org/pvldb/1/1453965.pdf).
Also, as vertices whom messages are sent to get created on the fly (if they don't exist already), we could potentially have a HBaseVertex that fetches the adjacency list + vertex value from HBase. That would be kind of a Lazy-load approach, if you can define the initial split as an HBase query.
Attachments
Issue Links
- is related to
-
GIRAPH-96 Support for Graphs with Huge adjacency lists
- Resolved
- is superceded by
-
GIRAPH-153 HBase/Accumulo Input and Output formats
- Resolved