Yes, creating an adjacency list graph model would be straight forward. The most important thing is to keep as many operations in flight as possible, as the graph model is essentially a lot of distributed pointer chasing. If you’re interested in some help with your evaluation, you can send me an email to the address in my profile.
3 comments
[ 2.8 ms ] story [ 15.7 ms ] threadHappy to answer any questions about my talk, the conference, or FoundationDB in general.
Is anyone using FoundationDB as a graphdb akin to Neo4j?
It seems to me Document Layers could be used to create virtual property edges from the underlying KV store?
Any thoughts/plans on how Foundation could be used as a graph in general?
Thanks!