Re:Nebula Graph: A Linearly Scalable, Distributed Graph Data...
by rajman187 on Monday April 27, 2020 @03:35AM
(#22993739)
Excellent points. To add, and I’m not taking away from the technical effort, but the use of “native graph” is rather misleading. Existing computer architecture cannot represent a graph with sequentialized memory access (1-dimensional). So any representation has to make assumptions and use random memory access patterns. A longer discussion here (obvious bias aside, the other no longer works at DSE): https://www.datastax.com/blog/2013/11/letter-regarding-nativ...
[ Parent
| on HN ]
Re:Nebula Graph: A Linearly Scalable, Distributed Graph Data...
by shermanye on Monday April 27, 2020 @05:22AM
(#22994265)
Thanks for the reply. "Native Graph" here means the system (including the storage and query engine) is designed around the Graph data structure. The opposite part of the "Native Graph" is usually called "multi-mode" databases. In other systems, the storage is designed either as tables, or as some other data structures. They only provide a Graph query interface to simulate the graph query engine. But behind the scene, they are still doing the SQL (or whatever) queries.
In Nebula, data are stored in a way so that getting all neighbors is actually a sequential read
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/