查询词典 query

A search engine selects one or more search hits from among a plurality of hits, wherein a hit is a reference to a page or a site, based on a user interest, comprising an input module for accepting a query from a user, the query representing an interest of the user; a tracking module for tracking the user's navigation through the plurality of pages, including at least a destination purchase page, the destination purchase page being a page from which the user makes a purchase; a sales module which records associations between purchases and queries where the associations are provided, at least in part by an output of the tracking module; and a search module, which takes as its inputs at least a query and sales associations of that query provided by the sales module, and which outputs one or more search hits based on at least the query and the sales associations of that query.

一搜索引擎从一一击的多数状态中选择一或更多搜索一击，在哪方面一一击是一参考一页的或者一地点把代表一用户的利益问题建立在一用户权益的基础上因为承认一从一个用户问题包括一投入模数；一因为跟踪用户的航行通过页的多数状态，目的地购买页，包含至少一目的地购买页，是一从其用户买东西的页跟踪模数；一记录在购买和问题之间协会其协会部分地至少被一输出提供的销售额模数的跟踪模数；和一把至少那经过销售额模数提供问题的一问题和销售额协会视为它的投入，和哪一个使出，把一或更多搜索一击建立在至少那问题的问题和销售额协会的基础上的搜索模数。

Based on monoid comprehension, we presented an extendable object query translation algorithm which can deal with nested subquery, query with existential and universal quantifier, query with aggregate function, query with sort/group. This algorithm converted the query into joins to the utmost to expect different physical implementations of join to raise execution efficiency.

基于幺群概括，我们提出了一个可扩充的对象查询转换算法，该算法可以处理嵌套子查询、带存在量词和全称量词的查询、带聚集函数的查询、带分组/排序的查询，具有较强的通用性，该算法也体现了我们尽可能地将查询转换成连接以期望用连接的多种物理算法提高执行效率的查询优化思想。

An application on top of Flashback Query can achieve this, but with less efficiency.

基于 Flashback Query的应用也可以实现相同的功能，但效率稍差。

The K-th number query is a fundamental problem in computer algorithm,which is a subroutine of numerous problems.

K-th number query是计算机算法中的一个基础问题，被广泛作为很多算法实现的重要步骤。

Furthermore, I'll demonstrate a polymorphic finder query and a couple of polymorphic method calls.

此外，我将示范一个多态的 finder query 和一组多态的方法的调用。

However, we also need the print operation to be virtualprinting a Query should print the Query_base object to which the Query points.

我们希望用户可以用标准输出操作符打印 Query 对象，但是，也需要打印操作是虚函数——打印 Query 对象应打印 Query 对象指向的 Query_base 对象。

So this paper puts forward an Energy Balance Data Query Protocol based on Ant Colony Optimization. This protocol rewards or punishes a path according to the energy consumption by pheromone decentralize energy consumption into different paths, and reposefully demotes the energy consumption of the whole network.

因此，提出一种基于蚁群优化的能量均衡数据查询协议EBDQ(energy balance data query protocol based on ant colony optimization)，根据路径上的能量消耗情况，通过信息素对其进行奖惩，使网络的能量消耗分散在不同的路径上，让整个网络的能量平稳降级。

The traditional query tree optimization methods,parallel database optimization methods based on left linear trees and right linear trees,bushy trees,and operation of the forest,have their own pros and cons,they have been more in-depth and maturity of the study.The query optimization method based on multiple weighted tree has studied its model of parallel query plan,its complexity model of parallel query plan and query optimization algorithms.The semantic query method transforms an inquiry into one or several semantic equivalence inquiries then has to find and implement a strategy to achieve a better query.Agent-based parallel database query optimization using Multi-Agent technology to automatically search the integrity constraint conditions which are related to the determined query,there for,the efficiency between several relations' joins has been greatly improved.The parallel optimization algorithm,based on genetic algorithm which is suitable for multi-joins of cluster environment,has deeply studied the relations storage options,multi-joins query optimization and query processing and other key technologies based on cluster parallel database.

传统的查询树优化方法，即基于左线性树、右线性树、浓密树、操作森林的并行数据库查询优化方法，各有优劣，对其的研究比较深入、成熟；基于多重加权树的查询优化方法，研究了其并行查询计划模型、并行查询计划的复杂性模型和查询优化算法；语义查询优化方法将一个查询变换成一个或数个语义等价的查询，进而寻找并执行这些等价查询中具有较好实现策略的一个；基于Agent的并行数据库查询优化采用Multi-Agent技术自动查找与给定查询有关的完整性约束条件，使得多个关系间连接操作的效率得到很大的提高；基于遗传算法的并行优化算法，深入研究了基于机群并行数据库中关系存储的选择、多连接查询优化和查询处理等关键技术。

Temporary variables often are so plentiful that they make extraction very awkward. In these cases I try to reduce the temps by using Replace Temp with Query. If whatever I do things are still awkward, I resort to Replace Method with Method Object. This refactoring doesn't care how many temporaries you have or what you do with them.

临时变量的应用常常会五花八门以至于让代码提取工作难以进行，对于这些情况，我会设法应用重整模式Replace Temp with Query来减少临时变量，如果我这样做了后，代码提取还是很棘手，我会求助于重构模式Replace Method with Method Object，这种重构模式不在乎你有多少临时变量也不在乎你是怎么用它们的。

This paper puts forward a new Difference Group Query based on two query points, the methods in GNN query which define several query points in a MBR are not suitable for the specific Difference Group Query in our paper. In this paper, based on the algorithm in YFK-CNN, we use the definition of hyperbola, divide the query space into several sections to delete the unsuitable space, furthermore, we develop several asymptotes from the definition of hyperbola, simplify the hyperbola based filter strategy in the search space.

文章提出了一种基于2个查询点的差值聚合查询，基于单查询点的YPK-CNN，利用双曲线性质把查询空间分成几大部分，在此基础上计算出双曲线的渐近线以简化删减条件，直接删减掉不符合条件的搜索空间。

Next time I see you,I shall give you a black eye.

下次我看见你，我会打你一顿。

In this paper,design scheme of classification system of wood surface color is established.

提出了木质板材颜色分类的系统设计方案。