客户端向其主名称服务器发送递归查询。
The client sends a recursive query to its primary name server.
递归查询失败是指归查询失败的总数。
Recursive query failure is the total number of recursive query failures.
递归超时是指递归查询发送超时总数。
Recursive timeouts is the total number of recursive query sending timeouts.
在递归查询中，该服务器执行请求并返回最终结果。
In a recursive query, the server does the asking and returns the final result.
递归查询失败是指归查询失败的总数。
递归查询处理是近年来数据库界普遍关心的问题。
The recursive query processing is, recently, a generally interested problem in database system field.
现在您应该能够使用下列语句创建具有分层或双向关系的所有类型的递归查询
You should now be able to create all kinds of recursive queries with either hierarchical or bi-directional relationships using
因此，递归查询解析人员、组的成员和子组的成员，而不管它们的嵌套深度如何。
Thus, recursive queries resolve persons, members of a group and members of subgroups, regardless of how deep they are nested.
一旦检测到循环，就会设置cycle子句中已定义好的适当标记，并停止分支的递归查询过程。
As soon as a cycle is detected the appropriate flag defined in the cycle clause is set and the recursive query process for the branch is stopped.
本文针对数据库递归查询计算问题的一个子类——线性递归查询计算问题进行了讨论。
The linear recursive query computation problem is a subset of database recursive query computation problem.
提出了一种树形知识表示方法，使递归查询可参考事实库状态，从而获得更高效的算法。
A new method of tree scheme knowledge representation is proposed. It enables the recursive query process to consult the states of the extensional database, making the algorithm more efficient.
但这一次我选择了另一种方法，从本系列上一期文章开发的WordNet服务器上递归查询XML。
This time, however, I prefer to show a different approach and present code that recursively queries the XML from the WordNet server developed in the previous installment of this series.
非递归查询允许服务器返回部分响应，例如返回可能知道答案(或可能具有更多信息)的服务器的名称或地址。
Non-recursive queries allow the server to return a partial response, such as returning the name or address of the server that may know the answer (or may have more information).
这种递归查询的模式对于名称服务器而言是可选的，并且名称服务器可以设置禁止客户端使用递归查询模式。
This service is optional in a name server, and the name server may also choose to restrict the clients which can use recursive mode.
非递归查询允许服务器返回部分响应，例如返回可能知道答案(或可能具有更多信息)的服务器的名称或地址。
Non - recursive queries allow the server to return a partial response, such as returning the name or address of the server that may know the answer (or may have more information).
在本文中，我提供了从oracle型CONNECT BY递归查询语法到DB 2中遵从标准的使用UNION ALL的递归公共表表达式的通用映射。
In this article I provided generic mappings from the Oracle style CONNECT BY recursive query syntax to DB2's standard compliant recursive common table expressions using UNION ALL.
我们以递归方式为解析名称和查询群组成员提供了两个帮助器类。
We have provided two helper classes for resolving names and querying group members in a recursive manner.
下图显示了查询递归数据的RCTE结构。
The following figure shows the structure of an RCTE for querying recursive data.
在这种情况下，查询应该只返回此容器中的结果，或者递归地返回容器的子容器中的结果，这取决于存储库的搜索行为。
When this is the case, your query should only return results within that container or within that container's sub-containers recursively, depending on your repository's search behavior.
查询可以具有两种类型：递归和非递归。
任何连接，甚至更复杂的查询，都可以用同样的方法通过将递归源的组成放入一个CTE中来表达。
Any joins, or even more complex queries, can easily be expressed in the same way by simply pushing the composition of the source for the recursion into a CTE.
Stats对象在以递归模式查询数据时也可以选择性地包括Stats对象列表。
A Stats object may optionally have a list of Stats objects when querying the data in a recursive mode (such as when the Boolean parameter is set to true).
至此我已经介绍了记录递归路径和在运行时检测递归的功能，实际上还可以映射Oracle的CONNECT BY查询语法中的NOCYCLE关键字。
Now that I have introduced the capability to record the path of a recursion and to detect recursion at runtime, it is possible to map the NOCYCLE keyword of Oracle's CONNECT BY query syntax.
如果查询是递归的(请参见usersofgroup或search查询)，则后续递归的数量将是无限的。
If the query is recursive (see usersOfGroup or search queries), the number of subsequent recursions is not limited.
DNS服务器将不执行向其他DNS服务器的查询递归。
The DNS server will not perform recursion for queries to other DNS servers.
递归：采取的行动时，DNS服务器，请查询代表一个DNS解析。
Recursion: The action taken when a DNS server is asked to query on behalf of a DNS resolver.
算法充分利用路径的递归特性，降低问题的规模，实现了较小空间花费下的海量路径随机查询。
By the recursive property, the new algorithm can reduce the size of problem which derives the paths with a small space required.
算法充分利用路径的递归特性，降低问题的规模，实现了较小空间花费下的海量路径随机查询。
By the recursive property, the new algorithm can reduce the size of problem which derives the paths with a small space required.
应用推荐