扩展XML-RL查询代数的设计是为了支持具有面向对象特征的查询。
The design of extending XML-RL query algebra is to support the querying with the object-oriented features.
本文简单分析了满足GIS空间查询代数的一般要求，然后形式化地定义了一种适合于GIS空间查询的变量查询代数。
General requirements of spatial query in GIS are briefly outlined in this paper. A Variable query Algebra is formally defined for spatial query of GIS.
XQueC还设计了用来评估XML查询的代数。
XQueC has also designed an algebra for evaluating XML queries.
查询是Rails3关系代数的一个示例。
关系代数的派生算子在关系数据库查询语言中得到了广泛应用。
The derived relational algebra operators are widely used in the relational database query languages.
给出了中介关系数据模型，在此基础上构造了两类不同的中介关系数据库查询语言：中介关系演算和中介关系代数。
Based on this model, this paper constructs two different kinds of medium relational database query languages: medium relational calculus and medium relational algebra.
研究了基于本体代数的知识模型集成和基于本体推理、查询的知识模型处理。
The integration of knowledge model is based on ontology algebra and the process of knowledge model is based on ontology inference and query.
针对DBMS查询优化器如何生成成本最小的查询计划问题，给出关系代数表达式的优化规则。
Aiming at how the DBMS query optimizer to generate the smallest cost query plan, optimization rules of the relational algebra expression are given.
本文提出一种合并的对象代数以支持地理信息系统中的复杂查询。
This paper proposes a combined object algebra to support complex queries in GIS.
数据挖掘查询语言的设计是开发新一代数据挖掘系统的关键。
The design of data mining query language is the key of exploring new data mining systems.
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.
提出了一种能够把图像关系查询和基于内容查询相统一的集合代数模型。
A set algebraic model that can uni1 ~ the keywords-based relation query and content-based retrieval is presented.
根据这些算法和关系代数等价定理，给出了对关系代数查询树进行逻辑优化的规则，并证明了逻辑优化的正确性。
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.
根据这些算法和关系代数等价定理，给出了对关系代数查询树进行逻辑优化的规则，并证明了逻辑优化的正确性。
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.
应用推荐