Re:RedisGraph: a fast, queryable property graph database for...
by swilly022 on Monday October 22, 2018 @01:20AM
(#18272367)
Another reason has to do with memory access and cache invalidation, when working with sparse matrices the entire graph structure is laid out in a contiguous block of memory which is ideal for CPU caching, unlike adjacency list where you have lots for small allocations scattered all over the memory space, this makes a huge difference when traversing the graph.
[ Parent
| on HN ]
There are no comments on this comment yet.