Parsing of global query generates a query tree.
查询语句解析产生查询树。
The query tree is updated to record this exact series of steps.
更新查询树以确切地记录这些步骤。
Pattern trees form a natural basis to query tree-structured data such as XML and LDAP.
模式树是对像XML和LDAP等树形结构数据进行查询的基础。
The idea that use the structure of semantic meaning query tree as middle language is put forward.
提出了语义查询树的中间语言结构，设计了查询语句向语义查询树的转换算法。
The method of distributed query optimization is analyzed deeply which use semi-join algorithm and query tree disassembling.
并用实例证明其相对于没有进行分布式查询优化的算法可以大大减少网络上传输的数据量。
This paper presents an algorithm to dispatch the operations of the query tree, parallelize queries, and shorten the query time.
针对这种情况，本文提出一种对数据库查询树的分配算法，使查询并行化，缩短查询的响应时间。
We define a query tree to connect the user input with semantic query language SPARQL and study the algorithm to converse the query tree to SPARQL.
并设计了查询树这一数据结构用来连接用户输入和SPARQL语义查询语言，且研究了查询树和SPARQL的转换算法。
In the procedure of path decomposition and query plan selection, target node in the query tree is utilized to avoid the transfer of the intermediate results.
在路径分解和查询计划选择的过程中，利用查询树中的目标节点来避免中间结果的传递。
The transformation layer will apply an inference process (similar to forward-chaining) and check for each node in the plan tree to see which query transformations apply to that node.
转换层将应用一个推理过程(类似于前推链接法)，并检查规划树中的每个节点，看哪些查询转换适用于该节点。
We can then examine the equivalent symbolic tree representation of this query plan in Figure 1.
随后，我们可以查看图1，其中展示了这个查询计划的等效符号树表示形式。
Query the XML tree and return a products object.
查询此xml树并返回一个产品对象。
In the previous section you established a connection with the database. Now you will reuse the same connection to generate a type tree from a query.
在前面的小节中，您创建了一个数据库连接，现在您可以重用该连接从一个查询生成一个类型树。
Here are some techniques for avoiding long-running actions in the UI thread, using a common example: a table or tree that is filled from some sort of database query, network call, or disk.
有一些技术用来避免UI线程中的长时间运行动作，举一个常见的例子：使用某种数据库查询、网络调用或磁盘进行填充的表或树。
You can build an XML query visually by selecting sample resultant nodes from a tree representation of a schema or XML document and dragging the nodes onto a return grid.
您可以通过从一个模式或XML文档的树型表示中选择示例结果节点，并将这些节点拖放到一个返回网格中，从而可视化地构造一个 XML查询。
Enables or disables query plan tracing, also known as a plan tree, which captures the transformation process of a query.
启用或禁用查询规划跟踪，也称为规划树，它捕获一个查询的转换流程。
The parsing process will convert the incoming V5 query spec and any potentially embedded SQL or MDX queries into a tree representation.
解析过程会将传入的V 5查询规范或任何潜在的嵌入式SQL或MDX查询转换成一个树表示。
Because this information is a few nodes down in the tree, dot notation is used to indicate the exact hierarchical position of the required nodes to the query parser.
因为此信息是树下的几个节点，所以点符号用于说明针对查询解析器的所需节点的确切层次位置。
The run tree is at the heart of query execution and can consist of many different types of run tree nodes.
处于查询执行的核心，且可以包含多个不同类型的运行树节点。
A report request coming in to the Dynamic Query Mode will initially be parsed into a plan tree.
传入dynamicQueryMode的一个报表请求首先会被解析成一个规划树。
In contrast, XQuery forces any application to formulate its query based on the tree structure of the underlying XML schema.
相反，XQuery会强制任何应用程序基于基础XML模式的树结构确定其查询模式。
A CriteriaQuery is constructed at run time as a tree of strongly typed query expressions whose use the article has illustrated with a series of code examples.
CriteriaQuery在运行时被构建为一个强类型查询表达式树，本文通过一系列例子展示了它的用法。
With HResult the execution mode can combine MDX and XML in a single run tree, allowing for much higher flexibility and query performance.
通过 HResult，执行模式可以在单个运行树中结合MDX和XML，实现更高的灵活性和查询性能。
This fact makes a query like $fr['translations']['TREE']; somewhat hit and miss, unless the code making the query is sure of the provenance of the array.
这个事实使得类似 $fr['translations']['TREE'];的查询有些碰运气，除非进行查询的代码确定数组的起源。
Query expressions are the core units or nodes that are assembled in a tree to specify a CriteriaQuery. Figure 1 shows the hierarchy of query expressions defined in the Criteria API.
查询表达式是在一个树中组装的核心单元或节点，用于指定CriteriaQuery。
Manipulations like this (backed by the proper relational theory) are at the heart of database query optimizers. The resulting tree is shown in Figure 2.
此类操作(由恰当的关系理论作为支持)是数据库查询优化器的核心所在。
She can execute directly from this query, or she can return to the tree view and run her tests from there.
她能够从这个查询中直接执行，也可以返回到属性图表中从那里运行她的测试。
Expand your query in the tree structure in the left pane.
在左边的面板中，展开树结构中的查询。
The definition files for the perspective, the Navigation Tree, the Collection View, the Detail View, and the View Query were created for the Viewer perspective.
为查看者透视图创建了透视图、导航树、集合视图、详细信息视图和视图查询的定义文件。
The Navigation Tree and View Query definitions for the Viewer perspective are shown in Listings 4 and 5, respectively.
查看者透视图的导航树和视图查询定义分别显示在清单4和5中。
You need to clear the expando states when the tree grid performs a sorting query.
当树型网格执行一个排序查询时，您需要清除expando状态。
应用推荐