Time 在Gremlin控制台上显示时间_Time_Console_Gremlin

Time 在Gremlin控制台上显示时间

time gremlin

Time 在Gremlin控制台上显示时间,time,console,gremlin,Time,Console,Gremlin,我试图在Gremlin控制台中测量查询所花费的时间。是否可以用每个小精灵提示来显示时间？类似于在SQL console for Oracle上使用SET TIME ON的方式。没有任何东西可以显示每次提示执行的时间。当然，您可以对遍历计时，并获取有关如何使用概要文件在内部执行遍历的信息，并解释以下步骤： gremlin> g.V().out().profile() ==>Traversal Metrics Step

我试图在Gremlin控制台中测量查询所花费的时间。是否可以用每个小精灵提示来显示时间？类似于在SQL console for Oracle上使用SET TIME ON的方式。

没有任何东西可以显示每次提示执行的时间。当然，您可以对遍历计时，并获取有关如何使用概要文件在内部执行遍历的信息，并解释以下步骤：

gremlin> g.V().out().profile()
==>Traversal Metrics
Step                                                               Count  Traversers       Time (ms)    % Dur
=============================================================================================================
TinkerGraphStep(vertex,[])                                             6           6          12.308    88.82
VertexStep(OUT,vertex)                                                 6           6           1.268     9.15
NoOpBarrierStep(2500)                                                  6           4           0.281     2.03
                                            >TOTAL                     -           -          13.857        -
gremlin> g.V().out().explain()
==>Traversal Explanation
=======================================================================================
Original Traversal                 [GraphStep(vertex,[]), VertexStep(OUT,vertex)]

ConnectiveStrategy           [D]   [GraphStep(vertex,[]), VertexStep(OUT,vertex)]
IncidentToAdjacentStrategy   [O]   [GraphStep(vertex,[]), VertexStep(OUT,vertex)]
MatchPredicateStrategy       [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)]
RepeatUnrollStrategy         [O]   [GraphStep(vertex,[]), VertexStep(OUT,vertex)]
CountStrategy                [O]   [GraphStep(vertex,[]), VertexStep(OUT,vertex)]
PathRetractionStrategy       [O]   [GraphStep(vertex,[]), VertexStep(OUT,vertex)]
LazyBarrierStrategy          [O]   [GraphStep(vertex,[]), VertexStep(OUT,vertex)]
TinkerGraphCountStrategy     [P]   [GraphStep(vertex,[]), VertexStep(OUT,vertex)]
TinkerGraphStepStrategy      [P]   [TinkerGraphStep(vertex,[]), VertexStep(OUT,vertex)]
ProfileStrategy              [F]   [TinkerGraphStep(vertex,[]), VertexStep(OUT,vertex)]
StandardVerificationStrategy [V]   [TinkerGraphStep(vertex,[]), VertexStep(OUT,vertex)]

Final Traversal                    [TinkerGraphStep(vertex,[]), VertexStep(OUT,vertex)]