Re:Nebula Graph: A Linearly Scalable, Distributed Graph Data...
by rajman187 on Monday April 27, 2020 @05:48AM
(#22994382)
I see, thanks for the clarification. Can you expand on that a bit more? Is this some sort of index-free adjacency then? I still don't understand how the neighbours can be stored sequentially in memory, especially if this is a distributed system.
Re:Nebula Graph: A Linearly Scalable, Distributed Graph Data...
by ddorian43 on Monday April 27, 2020 @09:19AM
(#22995542)
dgraph.io uses posting lists.
I think the state of the art is https://github.com/GraphBLAS.
Examples: https://github.com/michelp/pggraphblas & https://github.com/RedisGraph/RedisGraph/
In Nebula, data are stored in a way so that getting all neighbors is actually a sequential read