Alessandro Presta created GIRAPH-579:
----------------------------------------
Summary: Make it possible to use different out-edges data
structures for input and computation
Key: GIRAPH-579
URL: https://issues.apache.org/jira/browse/GIRAPH-579
Project: Giraph
Issue Type: New Feature
Reporter: Alessandro Presta
Assignee: Alessandro Presta
In some cases, the properties we want in the VertexEdges implementation during
input may differ from the ones we want during computation.
Two examples:
1) During input, we want to keep only the top K edges according to weight, so
we use a fixed-size min-heap. During computation, our algorithm needs fast
random access, so we use a hash-map.
2) We have a VertexEdges implementation that's optimized for space and/or
iteration speed, but has slow insertion. We can then use a different data
structure that has fast insertion during input.
We can add an option to specify a different VertexEdges class to be used in
EdgeStore during input.
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see: http://www.atlassian.com/software/jira
