更新查询树以确切地记录这些步骤。
The query tree is updated to record this exact series of steps.
查询语句解析产生查询树。
提出了语义查询树的中间语言结构，设计了查询语句向语义查询树的转换算法。
The idea that use the structure of semantic meaning query tree as middle language is put forward.
在路径分解和查询计划选择的过程中，利用查询树中的目标节点来避免中间结果的传递。
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.
针对这种情况，本文提出一种对数据库查询树的分配算法，使查询并行化，缩短查询的响应时间。
This paper presents an algorithm to dispatch the operations of the query tree, parallelize queries, and shorten the query time.
根据这些算法和关系代数等价定理，给出了对关系代数查询树进行逻辑优化的规则，并证明了逻辑优化的正确性。
With these algorithms and the equivalence theory, the several rules to logically optimize the accessing trees were presented and the correctness for the logical optimization was proved.
并设计了查询树这一数据结构用来连接用户输入和SPARQL语义查询语言，且研究了查询树和SPARQL的转换算法。
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.
转换层将应用一个推理过程(类似于前推链接法)，并检查规划树中的每个节点，看哪些查询转换适用于该节点。
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.
随后，我们可以查看图1，其中展示了这个查询计划的等效符号树表示形式。
We can then examine the equivalent symbolic tree representation of this query plan in Figure 1.
在前面的小节中，您创建了一个数据库连接，现在您可以重用该连接从一个查询生成一个类型树。
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.
有一些技术用来避免UI线程中的长时间运行动作，举一个常见的例子：使用某种数据库查询、网络调用或磁盘进行填充的表或树。
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.
查询此xml树并返回一个产品对象。
为查看者透视图创建了透视图、导航树、集合视图、详细信息视图和视图查询的定义文件。
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.
查看者透视图的导航树和视图查询定义分别显示在清单4和5中。
The Navigation Tree and View Query definitions for the Viewer perspective are shown in Listings 4 and 5, respectively.
解析过程会将传入的V 5查询规范或任何潜在的嵌入式SQL或MDX查询转换成一个树表示。
The parsing process will convert the incoming V5 query spec and any potentially embedded SQL or MDX queries into a tree representation.
例如，清单2显示了在查询某个本地系统中的“system”树中的所有信息时的输出。
For example, Listing 2 shows the output when querying a local system for all the information within the 'system' tree.
CriteriaQuery在运行时被构建为一个强类型查询表达式树，本文通过一系列例子展示了它的用法。
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.
如清单1中所示的任何查询都有到指定数据的精确路径，DBMS可以迅速地在均衡树和字节偏移编码中确定它。
Any query such as the one in Listing 1 has a precise path to the specified datum, which a DBMS can quickly determine in balanced trees and byte-offset codings.
您可以通过从一个模式或XML文档的树型表示中选择示例结果节点，并将这些节点拖放到一个返回网格中，从而可视化地构造一个 XML查询。
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.
类型树可以从数据库、查询、已存储过程或视图自动生成。
Type Trees can be automatically generated from databases, queries, stored procedures, or views.
类型树可以从数据库、查询、存储过程或视图中自动生成。
Type Trees can be automatically generated from databases, queries, stored procedures, and views.
这一行访问ast树，起步于编辑单元(最顶层的节点)，并且查询所有的方法声明。
This line visits the AST tree, starting at the compilation unit (the top-most node), and queries for a list of all method declarations.
启用或禁用查询规划跟踪，也称为规划树，它捕获一个查询的转换流程。
Enables or disables query plan tracing, also known as a plan tree, which captures the transformation process of a query.
我们前面所介绍的规则是最简单的一种了，它只查询ast树中一种类型的节点，并且盲目地报告所有结果。
The rule that we previously examined is about as simple as a rule can get. It queries for only a single type of node in the AST tree and blindly reports all results remaining after filter.
每个XML文档均是定义良好的元素和属性树，并使用树遍历来表示XML查询。
Any XML document is a well-defined tree of elements and attributes, and XML queries are expressed in terms of tree traversal.
查询的执行次序和途径并非强制指定的，相反，它可以对表达树进行分析，以发现你所期望的结果，然后再决定如何处理；
Instead, it can analyze the expression tree, discover what you want done, and then decide how to do it.
被嵌入元素的名称与被查询表中的字段名称对应，而文档元素 —XML树的根 —被相应地命名为 。
The names of the nested elements correspond to the field names within the table being queried, while the document element — the root of the XML tree — is, aptly, named .
此属性所在的dsktable树实际上有一个磁盘百分比属性，我们原本应该查询此属性而不是手动对其进行计算。
The dskTable tree that this property is part of actually has a disk percentage property that we could have queried, instead of calculating it manually.
当树型网格执行一个排序查询时，您需要清除expando状态。
You need to clear the expando states when the tree grid performs a sorting query.
该审计会遍历contentstore树并会记录它所找到的所有对象(文件夹、报告、查询等)。
This audit will process through the content store tree and log all the objects (folders, reports, queries, etc.) that it finds.
应用推荐