You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@tinkerpop.apache.org by "stephen mallette (JIRA)" <ji...@apache.org> on 2017/02/15 00:44:42 UTC

[jira] [Updated] (TINKERPOP-1627) LazyBarrierStrategy should not append an end barrier.

     [ https://issues.apache.org/jira/browse/TINKERPOP-1627?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

stephen mallette updated TINKERPOP-1627:
----------------------------------------
    Fix Version/s:     (was: 3.2.4)
                   3.2.5

> LazyBarrierStrategy should not append an end barrier.
> -----------------------------------------------------
>
>                 Key: TINKERPOP-1627
>                 URL: https://issues.apache.org/jira/browse/TINKERPOP-1627
>             Project: TinkerPop
>          Issue Type: Improvement
>          Components: process
>            Reporter: Marko A. Rodriguez
>             Fix For: 3.2.5
>
>
> {code}
> gremlin> g.V().out().explain()
> ==>Traversal Explanation
> ==============================================================================================================
> Original Traversal                 [GraphStep(vertex,[]), VertexStep(OUT,vertex)]
> ConnectiveStrategy           [D]   [GraphStep(vertex,[]), VertexStep(OUT,vertex)]
> RangeByIsCountStrategy       [O]   [GraphStep(vertex,[]), VertexStep(OUT,vertex)]
> RepeatUnrollStrategy         [O]   [GraphStep(vertex,[]), VertexStep(OUT,vertex)]
> MatchPredicateStrategy       [O]   [GraphStep(vertex,[]), VertexStep(OUT,vertex)]
> PathRetractionStrategy       [O]   [GraphStep(vertex,[]), VertexStep(OUT,vertex)]
> IncidentToAdjacentStrategy   [O]   [GraphStep(vertex,[]), VertexStep(OUT,vertex)]
> FilterRankingStrategy        [O]   [GraphStep(vertex,[]), VertexStep(OUT,vertex)]
> InlineFilterStrategy         [O]   [GraphStep(vertex,[]), VertexStep(OUT,vertex)]
> AdjacentToIncidentStrategy   [O]   [GraphStep(vertex,[]), VertexStep(OUT,vertex)]
> LazyBarrierStrategy          [O]   [GraphStep(vertex,[]), VertexStep(OUT,vertex), NoOpBarrierStep(2500)]
> TinkerGraphCountStrategy     [P]   [GraphStep(vertex,[]), VertexStep(OUT,vertex), NoOpBarrierStep(2500)]
> TinkerGraphStepStrategy      [P]   [TinkerGraphStep(vertex,[]), VertexStep(OUT,vertex), NoOpBarrierStep(2500)]
> ProfileStrategy              [F]   [TinkerGraphStep(vertex,[]), VertexStep(OUT,vertex), NoOpBarrierStep(2500)]
> StandardVerificationStrategy [V]   [TinkerGraphStep(vertex,[]), VertexStep(OUT,vertex), NoOpBarrierStep(2500)]
> Final Traversal                    [TinkerGraphStep(vertex,[]), VertexStep(OUT,vertex), NoOpBarrierStep(2500)]
> {code}
> The only time this is cool is for {{RemoteTraversal}} because you want to barrier as much as you can to reduce over the wire costs. However, {{RemoteStrategy}} should append an end-barrier. No other strategy should do this --- its just wasted clock cycles.



--
This message was sent by Atlassian JIRA
(v6.3.15#6346)