Based on some reading and going through the code, looks like Dgraph uses posting lists/adjacency lists. It appears this vocabulary comes from Facebook?

We’re interested in doing some research to see if Dgraph would benefit from sparse adjacency matrices, like RedisGraph. Has anyone tried this out, even has a proof-of-concept? Is this even worth trying?

Any ideas appreciated, thanks!