[HAMA-783] Efficient InMemory Storage for Vertices

• Type: Improvement
• Status: Resolved
• Priority: Major
• Resolution: Fixed
• Fix Version/s: 0.7.0
• Component/s: graph
• Assignee: Edward J. Yoon
• Reporter: Edward J. Yoon
• Created: 21/Jul/13 09:05
• Updated: 08/Jan/14 07:56
• Resolved: 08/Jan/14 07:56

Description

Currently there are ListVerticesInfo, DiskVerticesInfo and DirectMemory, but I personally think we have to do a big re-design of the vertices storage and graph job runner.

Actually, the size of split is not so great. Maybe, 60 ~ 200MB. Hence, I don't think DiskVerticesInfo will be really helpful. Instead, we can use the Serialization like Spark.

Update:

1) We also need to consider the checkpointing for Fault Tolerance, periodically.

2) If DiskVerticesInfo shows good performance, we can use just the DiskVerticesInfo.