证明了关于查询等价和有限步数引理，讨论了不同条件下信息检索算法的复杂度，并在试验中验证了信息动态路由算法的可行性和高效率。
The lemma of query equivalent and lemma of limited steps was proved and the complexity of information query algorithm in different conditions was discussed.
您始终可以将嵌套查询转换成等价的连接。
You can always convert a nested query into an equivalent join.
根据这些算法和关系代数等价定理，给出了对关系代数查询树进行逻辑优化的规则，并证明了逻辑优化的正确性。
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.
ASQL是基于对象代数的查询语言，本文讨论了对象代数表达式的等价变换规则，利用这些规则进行查询优化。
ASQL is a query language based on object algebra. Also we discuss the rules of equivalence transform and can use these rules to process query optimization.
该实现算法以QC树的结构为基础，结合深度优先算法和等价类的覆盖关系对QC树进行维护和查询。
The implementation maintains and queries QC-tree based on the structure of QC-tree, combining the deep first algorithm and cover of equivalent classes.
针对XML文档关键字搜索问题，从元素标签内容等价和元素结构相似性等价两个方面考虑无效的查询结果。
Concerning the keyword search in XML document, the meaningless query results are studied from two aspects: equivalence of content in element labels and similarity in element structure.
针对XML文档关键字搜索问题，从元素标签内容等价和元素结构相似性等价两个方面考虑无效的查询结果。
Concerning the keyword search in XML document, the meaningless query results are studied from two aspects: equivalence of content in element labels and similarity in element structure.
应用推荐