Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

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.


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/




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: