Major Description
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)]
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.
Attachments
Issue Links
- links to
