I want to know how data are stored in the database. Can we move vertices between machines? The thing is that for high throughput and good performance, we need to minimize traversal between nodes.
Fox example, if we store 100 friends of a user in a distributed graph database (for example 10 node cluster) and try to get the list of the user’s friends, then is is a high probability that all 10 nodes will be interacting in this query.
That is why throughput of 10 servers will be the same as 1 server and performance will be even terrible because of many hops.
That is why logically we need to minimize graph traversal as much as possible.
Solution of Facebook is here:
I want to know if it is possible to use Apache Giraph and Kernighan–Lin algorithm with Dgraph.