Application of traversal strategies taking >6x longer than traversal execution
Has any providers dealt with traversal strategies taking a really long time in large nested traversals (nested with coalesce branches)? Just the default tinkerpop strategies are taking >120 ms to apply while the query executes in ~20 ms.
I looked through and found it is the recurse applyTraversal function which I am thinking of rewriting with some other code but I don't know if it will be much faster. I figured other providers must have dealt with this as well.
I looked through and found it is the recurse applyTraversal function which I am thinking of rewriting with some other code but I don't know if it will be much faster. I figured other providers must have dealt with this as well.
Solution
there are two fixes landing for this issue in 3.5.6/3.6.3 - these are the two PRs that are relevant: https://github.com/apache/tinkerpop/pull/2009 and https://github.com/apache/tinkerpop/pull/2026
GitHub
https://issues.apache.org/jira/browse/TINKERPOP-2919
Shortcut some of the recursion in the strategy with a cache that basically captures TraversalParent information formerly calculated and recalcul...
Shortcut some of the recursion in the strategy with a cache that basically captures TraversalParent information formerly calculated and recalcul...
GitHub
https://issues.apache.org/jira/browse/TINKERPOP-2855
https://issues.apache.org/jira/browse/TINKERPOP-2888
Removed some recursion. Added Traversal.lock() to offer a formal way to finalize a traversa...
https://issues.apache.org/jira/browse/TINKERPOP-2888
Removed some recursion. Added Traversal.lock() to offer a formal way to finalize a traversa...
Apache TinkerPop is an open source graph computing framework and the home of the Gremlin graph query language.
1,376Members
Resources
Recent Announcements
Similar Threads
Was this page helpful?
