What's JanusGraph's strategy to reduce instance-wise communication in clusters?


When querying against a large graph, great time costs may occur. For example, if a vertex's adjacent vertices lies on another machine, then queries like "find father of this person" may slow down due to network communication.

Is there any strategy or optimization JanusGraph uses to reduce such costs? Considering that SimpleBulkPlacementStrategy simply assign new vertices randomly to different partitions, which means adjacent vertices are likely to be in different machines.

Join janusgraph-dev@lists.lfaidata.foundation to automatically receive all group messages.