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.
一旦检测到循环，就会设置cycle子句中已定义好的适当标记，并停止分支的递归查询过程。
In our example, if we consider an environment with 10 regions, 100 branches per region, and 10,000 loans per branch, we end up creating over 10 million objects to answer the query.
本例中，如果我们考虑：该银行遍及10个区域，每个区域有100家支行，而每家支行又有10,000份贷款，我们总共创建了1000万多个对象来响应该查询。
Also developed for the PRA tree is an enhanced predictive range aggregate (EPRA) query algorithm which USES a more precise branch and bound searching strategy, reducing the disk I?
提出了一种增强预测范围聚集查询epra算法，采用更精确的剪枝搜索准则，减少了查询所需要访问的节点代价。
应用推荐