Level simply determines how many layers the query algorithm is applied to.
Level仅仅决定查询算法应用于多少层。
An approximate XML query algorithm based on clustering of XML documents is proposed.
提出了一种基于XML文档聚类的XML近似查询算法。
Furthermore, the perspective query algorithm can decrease the complexity of implementing the mechanism.
通过采用透视查询算法，简化了该机制实现的复杂度。
In this paper, based-on attribute-cluster, a new spatiotemporal data aggregation query algorithm is proposed.
提出了基于属性簇的时空数据聚集查询算法。
The mapping information query algorithm can exactly find out the correlative semantic mapping information by a set comparing method.
使用比较集合相似度的多值信息系统查询算法能准确地查找出相关语义映射信息。
This paper presents a map query algorithm and defines a query language based on mobile equipment, termed the embed geography SQL (EGSQL).
提出基于移动设备的地图查询算法，定义了EGSQL查询语言，给出了EGSQL查询实现的标准流程。
The experimental result shows that the query efficiency of the optimal location query algorithm remains effective with the parameters varying.
实验结果表明，在参数不同取值情况下最优位置查询算法的查询性能仍然高效。
A query algorithm and distributed backup model based on session manager are proposed to guarantee the reliability of cooperative editing systems.
提出一种基于会话管理器的站点查询算法和分布式备份模型，保证系统可靠协作。
Hash function plays an important role in the query algorithm, and the query algorithms based on it achieves a constant time complexity in theory.
散列函数在查询算法中起着重要作用，基于此的查询算法在理论上可达到常数级时间复杂度。
The article designs a kind of SPDB organization based on key tree and corresponding query algorithm, which makes average query length shorten a lot.
该文设计了一种基于键树思想的SPDB组织方式和相应的查找算法，使平均查找长度大为缩短。
Three algorithms: Information Query Algorithm, DIRA( Dynamic Information Route Algorithm), IRH Route Exchange Algorithm of the Boundary Area were proposed.
提出并实现了信息检索算法，动态信息路由交换算法DI RA和边界域IRH的路由交换算法；
The lemma of query equivalent and lemma of limited steps was proved and the complexity of information query algorithm in different conditions was discussed.
证明了关于查询等价和有限步数引理，讨论了不同条件下信息检索算法的复杂度，并在试验中验证了信息动态路由算法的可行性和高效率。
The distributed data query is the core of the distributed database managing system, but the optimized query algorithm is the key technology in query processing.
分布式数据查询是分布式数据库管理系统的核心，而查询优化算法又是查询处理中的关键技术。
The distribute data query is the core of the distribute database manages system, but the optimized query algorithm is the key technology in query the processed.
分布式数据查询是分布式数据库管理系统的核心，而查询优化算法又是查询处理中的关键技术。
We propose a continue reverse nearest neighbor(CRNN) query algorithm in road networks, which can return the moving objects influenced by the static query point.
目的在交通网络中实现移动对象的定点CRNN查询监控，确定受到定点影响的移动对象集合。
The distributed data query is the core of the distributed database managing system, but the optimized query algorithm is the key technology in query processing.
多级安全查询处理器是多级安全数据库的核心部分，它提供对安全级查询的支持。
Based on Z curve, the paper presents a method of grid partition, a procedure of partitioning search region, and a high-dimensional spatial range query algorithm.
利用Z曲线聚类和降维特性，本文给出网格划分方法、搜索区域分解过程，提出一种高维空间范围查询算法。
This paper presents an optimized query algorithm, which adopts direct-join using data partition and parallel processing. It can reduce the response time of query process.
本文利用数据分片和并行处理策略，提出一种采用直接连接的查询优化算法，能有效地缩减查询处理的响应时间。
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算法，采用更精确的剪枝搜索准则，减少了查询所需要访问的节点代价。
A search query returns a set of objects, each of them will be processed individually, using the algorithm described in 1.1.
搜索查询返回一组对象，其中每个对象将使用1.1中描述的算法单独进行处理。
A search query returns a set of objects and each of them will be processed individually using the algorithm described in 2.1.
搜索查询返回一组对象，并且其中每个对象将使用2.1中描述的算法单独进行处理。
The following parameters can be used to control the maximum number of ATQs that the asynchrony algorithm will place within a single query.
下面的参数可用于控制异步算法可以放入到单个查询中的ATQ的最大数量。
As you iterate over the query expressions, your algorithm may need to correct for double negatives. Consider a query expression like this one.
在遍历查询表达式时，算法可能需要纠正双重否定。
XQueC exploits the query workload information to partition the containers into sets according to the source model and to properly assign the most suitable compression algorithm to each set.
XQueC利用查询工作负载信息，根据源模型将容器分为不同的集，并为每个集分配最适当的压缩算法。
A query subject that USES a stored procedure to access the cluster information of the clustering model created by the mining algorithm.
查询主题使用存储过程访问由挖掘算法创建的集群模型的集群信息。
This algorithm is implemented under the covers in the task editor, and you won't normally see it, but when creating AD hoc tasks or new staff query verbs, you should be aware of it.
此算法在任务编辑器的后台实施，通常不会看到它，但当创建临时任务或新任务查询谓词时，您会注意到它。
Responding to the trait of URMS, we design a XML stream querying algorithm in query groupware.
针对URMS的特点，在其查询组件中设计了一种基于流的XML查询算法。
A large amount of memories are consumed during dense data querying. A query processing algorithm based on XML stream is designed.
针对密集型数据查询要消耗大量内存的缺陷，设计了一种基于流的XM L文档查询算法。
The optimizer avoids generating access plans using the hash distinct algorithm if it detects that a low memory situation may occur during query execution.
如果优化程序检测到在查询执行过程中可能会出现内存不足的情况，它将避免使用非重复散列算法生成访问计划。
The optimizer avoids generating access plans using the hash distinct algorithm if it detects that a low memory situation may occur during query execution.
如果优化程序检测到在查询执行过程中可能会出现内存不足的情况，它将避免使用非重复散列算法生成访问计划。
应用推荐