[
https://issues.apache.org/jira/browse/TINKERPOP-1642?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15894208#comment-15894208
]
stephen mallette commented on TINKERPOP-1642:
---------------------------------------------
I've made some improvements in my TINKERPOP-1642 branch that has just been
pushed. I've added some gremlin-benchmarks on tp32 to help aid with comparisons
for the specific types of improvements we're trying to measure. So - we can get
a baseline of performance from tp32 and then run the same benchmarks on
TINKERPOP-1642 for comparison. Right now, large chained mutating traversals and
{{addV}} with properties are improved by a factor of 2-3X depending on exactly
what's being measured. While that's a nice improvement, I think there is more
to be done. I'll also add that my changes at this point probably need some
refinement as I'm trying to work within the rules of the existing APIs.
> Improve performance of mutating traversals
> ------------------------------------------
>
> Key: TINKERPOP-1642
> URL: https://issues.apache.org/jira/browse/TINKERPOP-1642
> Project: TinkerPop
> Issue Type: Improvement
> Components: process
> Affects Versions: 3.2.4
> Reporter: stephen mallette
> Assignee: stephen mallette
> Priority: Critical
>
> 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.
--
This message was sent by Atlassian JIRA
(v6.3.15#6346)
