[jira] [Commented] (TINKERPOP-965) Optimize TraversalStrategy application
[
https://issues.apache.org/jira/browse/TINKERPOP-965?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel=15628710#comment-15628710
]
Marko A. Rodriguez commented on TINKERPOP-965:
--
Any more developments in this area? If there is nothing else to do, can you
please close the ticket.
> Optimize TraversalStrategy application
> --
>
> Key: TINKERPOP-965
> URL: https://issues.apache.org/jira/browse/TINKERPOP-965
> Project: TinkerPop
> Issue Type: Improvement
> Components: process
>Affects Versions: 3.1.0-incubating
>Reporter: Marko A. Rodriguez
>Assignee: Ted Wilmes
>
> From the work of [~twilmes], it appears that we can gain a lot by making
> {{Traversal.applyStrategies()}} as fast as possible. This is going to be
> especially important as we transition people away from using
> "Blueprints-methods" (e.g. {{Graph.addVertex()}} and {{Vertex.addEdge()}}) to
> "Gremlin-methods" (e.g. {{g.addV()}} and
> {{g.V().as('a').out().addE('knows').from('a')}}).
> Obviously the "Blueprints-methods" will always be faster given that they are
> direct calls to the underlying provider. However, they should not be so
> ridiculously faster that people won't use the "Gremlin-methods." Furthermore,
> given [~dkuppitz]'s recent work with {{BulkLoaderVertexProgram}} and soon
> TINKERPOP3-942, the "Gremlin-methods" will be the only way to get these
> features.
> In general, the work should go beyond the {{Mutation}}-steps and make it so
> that all traversals compile as fast as possible. The first step is to realize
> where things are slow and knock those out firsthopefully we realize some
> tricks!
> Related to: TINKERPOP3-957
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
[jira] [Commented] (TINKERPOP-965) Optimize TraversalStrategy application
[
https://issues.apache.org/jira/browse/TINKERPOP-965?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel=15527359#comment-15527359
]
Ted Wilmes commented on TINKERPOP-965:
--
I've made some initial profiling progress but will be doing another round with
the strategy additions and updates. Providing I can make some worthwhile
performance improvements, I'll be targeting this for inclusion in the next
release.
> Optimize TraversalStrategy application
> --
>
> Key: TINKERPOP-965
> URL: https://issues.apache.org/jira/browse/TINKERPOP-965
> Project: TinkerPop
> Issue Type: Improvement
> Components: process
>Affects Versions: 3.1.0-incubating
>Reporter: Marko A. Rodriguez
>Assignee: Ted Wilmes
>
> From the work of [~twilmes], it appears that we can gain a lot by making
> {{Traversal.applyStrategies()}} as fast as possible. This is going to be
> especially important as we transition people away from using
> "Blueprints-methods" (e.g. {{Graph.addVertex()}} and {{Vertex.addEdge()}}) to
> "Gremlin-methods" (e.g. {{g.addV()}} and
> {{g.V().as('a').out().addE('knows').from('a')}}).
> Obviously the "Blueprints-methods" will always be faster given that they are
> direct calls to the underlying provider. However, they should not be so
> ridiculously faster that people won't use the "Gremlin-methods." Furthermore,
> given [~dkuppitz]'s recent work with {{BulkLoaderVertexProgram}} and soon
> TINKERPOP3-942, the "Gremlin-methods" will be the only way to get these
> features.
> In general, the work should go beyond the {{Mutation}}-steps and make it so
> that all traversals compile as fast as possible. The first step is to realize
> where things are slow and knock those out firsthopefully we realize some
> tricks!
> Related to: TINKERPOP3-957
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
