Details
-
Improvement
-
Status: Closed
-
Critical
-
Resolution: Fixed
-
None
-
None
Description
A 1 million vertex graph with 1 edge each is a 150meg file. That is 150 bytes per vertex/edge.
If the vertex id is a long that is 4 bytes.
If the edge id is a long that is 4 bytes.
The edge should only have ONE id for the otherV of 4 bytes.
The edge label should be somehow "enum'd" and 1 byte.
The vertex label should be somehow "enum'd" and 1 byte.
Add 2-3 bytes for terminators.
Thus, we should be able to get away with a 17 byte representation (assuming no variable width encodings) and thus, a 17 meg file. That is a near 10x file size reduction.