[TINKERPOP-1642] Improve performance of mutating traversals

• Type: Improvement
• Status: Closed
• Priority: Critical
• Resolution: Fixed
• Affects Version/s: 3.2.4
• Fix Version/s: 3.2.5
• Component/s: process
• Assignee: Stephen Mallette
• Reporter: Stephen Mallette
• Created: 01/Mar/17 18:43
• Updated: 30/Mar/17 20:03
• Resolved: 30/Mar/17 20:03

Description

Make an attempt improve performance of mutating traversals. Some general goals for this ticket should be to:

1. Improve performance parity of structure and process methods for modifying the graph - structure is pretty far ahead.
2. Improve the speed of large chained mutating traversals - see http://stackoverflow.com/q/41926409/1831717
3. Determine ways to make these performance improvements in gremlin-core so that they may benefit all Graph implementations
4. Improve the speed of TinkerGraph specifically if possible as it is used for subgraphing functions in many cases and ends up being useful regardless of the graph implementation ultimately used.

Issue Links

• is related to: TINKERPOP-1656 Write-time compilation of mutation steps
• relates to: TINKERPOP-1366 TraversalStrategy.isApplicable(Traversal root)
• links to: GitHub Pull Request #587