For example in twitter how can we find path between person a to person b ? The query using repeat is recursive and can be very heavy on a big graph.how can i use olap for better performance?.or there is another way?
1 Answers
0
votes
One mechanism to mitigate the "heft" of this operation in OLTP mode, i.e. the potential full cluster/graph scan, is to use a time limit via Gremlin. The trade off though is that you may not find the path between the two vertices due to reaching the time limit.
OLAP would enable an operation likes this as it's designed to process "wide" traversals. Please note that 5.1 will have a lot of focus on performance improvements for full graph operations.
