You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@tinkerpop.apache.org by "Marko A. Rodriguez (JIRA)" <ji...@apache.org> on 2016/06/21 22:46:58 UTC
[jira] [Closed] (TINKERPOP-1332) Improve .explain() Dialogue
[ https://issues.apache.org/jira/browse/TINKERPOP-1332?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]
Marko A. Rodriguez closed TINKERPOP-1332.
-----------------------------------------
Resolution: Implemented
Fix Version/s: 3.2.1
> Improve .explain() Dialogue
> ----------------------------
>
> Key: TINKERPOP-1332
> URL: https://issues.apache.org/jira/browse/TINKERPOP-1332
> Project: TinkerPop
> Issue Type: Improvement
> Components: process
> Affects Versions: 3.2.0-incubating
> Reporter: Russell Alexander Spitzer
> Assignee: Marko A. Rodriguez
> Priority: Minor
> Fix For: 3.2.1
>
>
> Currently the output of explain gives you a long list of strategies but no details about their application
> {code}
> ==>Traversal Explanation
> ============================================================================================================================
> Original Traversal [GraphStep(vertex,[]), CountGlobalStep]
> HaltedTraverserStrategy [D] [GraphStep(vertex,[]), CountGlobalStep]
> ConnectiveStrategy [D] [GraphStep(vertex,[]), CountGlobalStep]
> VertexProgramStrategy [D] [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]), ComputerResultStep]
> OrderLimitStrategy [O] [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]), ComputerResultStep]
> IdentityRemovalStrategy [O] [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]), ComputerResultStep]
> FilterRankingStrategy [O] [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]), ComputerResultStep]
> IncidentToAdjacentStrategy [O] [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]), ComputerResultStep]
> RangeByIsCountStrategy [O] [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]), ComputerResultStep]
> AdjacentToIncidentStrategy [O] [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]), ComputerResultStep]
> MatchPredicateStrategy [O] [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]), ComputerResultStep]
> GraphFilterStrategy [O] [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]), ComputerResultStep]
> PathProcessorStrategy [O] [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]), ComputerResultStep]
> SparkInterceptorStrategy [P] [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]), ComputerResultStep]
> SparkSingleIterationStrategy [P] [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]), ComputerResultStep]
> ProfileStrategy [F] [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]), ComputerResultStep]
> LambdaRestrictionStrategy [V] [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]), ComputerResultStep]
> ComputerVerificationStrategy [V] [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]), ComputerResultStep]
> StandardVerificationStrategy [V] [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]), ComputerResultStep]
> Final Traversal [TraversalVertexProgramStep([GraphStep(vertex,[]), CountGlobalStep]), ComputerResultStep]
> {code}
> It would be helpful if filter strategies for example would list the filters used.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)