You can obtain the statistics from the table descriptor of the table node in the underlying access path graph.
您可以从基础访问路径图中的表节点的表描述符处获得该统计信息。
In the Performance Call Graph view (Figure 3), the line's thickness indicates the amount of time the application spends along that code path.
在性能调用图视图(图3)中，线的粗细指出应用程序沿着代码路径花费的时间。
This article described the basic concepts of access paths and how to read an access path graph.
本文描述了访问路径的基本概念以及如何解读访问路径图。
There is no FETCH or table node shown in the access path graph because it is an index-only scan.
因为其是一个唯一索引扫描，所以在访问路径图中不显示FETCH或表节点。
To see the table descriptor, right-click the table node in the access path graph.
为了查看表描述符，请右键单击访问路径图上的表节点。
The rest of this section takes you through the access path graph one more time from the data flow perspective so that you can gain a full understanding of the performance aspect of query execution.
本节的其余部分再一次以数据流的观点向您介绍访问路径图以便您可以在查询执行的性能方面获得充分的理解。
Data flows from the bottom up (as displayed in the graph) and is processed by operation nodes in the access path graph.
数据从下往上流动(如访问路径图所示)并通过访问路径图上的操作节点处理。
XML-based query languages are constructed to reach any arbitrary position within an XML document's "graph" using sequences of edge labels and delimiters representing a path.
基于XML的查询语言被构造来，使用表示路径的边标签和定界符序列达到XML文档图中的任意位置。
In Figure 2, the descriptor for the table node and the descriptor for the TBSCAN node are shown to the left of the access path graph.
在图2中，表节点的描述符和TBSCAN节点的描述符显示在访问路径图的左侧。
An access path graph not only describes the "operational details" of query execution, it also describes how the data flows.
访问路径图不但描述“操作细节”，而且描述数据如何流动。
The SQL statement in Listing 5 creates the access path graph shown in Figure 5.
清单5中的sql语句创建如图5所示的访问路径图。
The SQL statement in Listing 3 creates the access path graph shown in Figure 3.
清单3中的SQL语句创建如图 3所示的访问路径图
The SQL statement in Listing 6 creates the access path graph shown in Figure 6.
清单6中的sql语句创建如图6所示的访问路径图。
The SQL statement in Listing 4 creates the access path graph shown in Figure 4.
清单4中的sql语句创建如图4所示的访问路径图。
The SQL statement in Listing 8 creates the access path graph shown in Figure 8.
清单8中的sql语句创建如图8所示的访问路径图。
The description of each operation includes a Query Tuner access path graph that explains its operational semantics.
每一个操作的描述都包括一个解释其操作语义的QueryTuner访问路径图。
Similarly, the last leg in the access path graph is evaluated eight times, once for each record produced by the first NLJOIN node.
同样，访问路径图的最后一步要评估8次，通过第一个NLJOIN节点产生的每条记录都要评估一次。
This section illustrates how the query Tuner query annotation and access path graph can help you analyze access paths and SQL performance.
本部分说明QueryTuner查询注释和访问路径图如何帮助您分析访问路径和SQL性能。
Figure 1 is the access path graph generated by Optim query Tuner for the query shown in Listing 1.
图1是通过清单1所示的适用于查询的OptimQueryTuner生成的访问路径图。
Table 1 describes the input, output, and function of several operation nodes that typically appear in an Optim Query Tuner access path graph.
表1描述通常出现在OptimQueryTuner访问路径图上的输入、输出和几个操作节点的功能。
An index scan is typically shown in Query Tuner as a group of four nodes in the access path graph.
在访问路径图中，一个索引扫描通常作为一组四个节点显示在QueryTuner上。
Figure 6 is the access path graph generated by query Tuner for the sample query in this article.
图6是QueryTuner为本文中大的查询样例生成的访问路径图。
The SQL statement in Listing 2 creates the access path graph shown on the right side of the Optim Query Tuner screenshot in Figure 2.
清单2中的sql语句创建如图2上的OptimQueryTuner截图右侧所示的访问路径图。
Additionally, Trace objects know how to create a Path object for either the high-low portion of the graph or the close portion of the graph.
此外，Trace对象知道如何为图像中的最高、最低和收盘价部分创建Path对象。
Utilizing the shortest path algorithm in Graph Theory to search functional dimension chains automatically in the assembly model and ascertain the functional dimensions of the part.
运用图论中的最短路径搜索算法从装配模型中自动搜索出功能约束尺寸链，确定零件的功能尺寸。
It has profited from the domestic and foreign research results, in this foundation, it discussed automatic production of attack path, as well as attack graph algorithm comparison.
同时，在借鉴国内外研究成果的基础上，探讨了攻击路径的自动生成算法以及对攻击图相关的算法之间的优缺点进行了比较。
Additionally common graph based algorithms like path-searches are easy to implement by traversing through the graph.
另外，基于如路径-查询(Path - Search)算法的普通图，也易于通过遍历图来实现。
Path is one of the important concepts of graph theory, and there are also extensive applications in ventilation network theory.
通路是图论中的一个重要概念，在通风网络中也有着广泛的用途。
Neither Eular circuit nor Eular path exists in this graph, since there are more than two vertices with odd degree.
这个图既没有欧拉回路，也没有欧拉路径。因为有超过两个顶点的度数为奇数。
The continually optimized connecting relation is gained via perceptron and XOR function, then the optimal path graph is found.
利用感知器异或函数获得了节点之间不断优化的连接关系，然后得到最优路径图。
应用推荐