- 更多网络例句与线性查找相关的网络例句 [注：此内容来源于网络，仅供参考]
-
A linear search was taking forever, so a binary search was needed.
一个线性查找永远是吸引人的。所以一个二分查找是需要的。
-
As a worst case, if the words are already in order, this program does an expensive simulation of linear search.
最坏的情况下，若单词已经排好序，则程序模拟线性查找的开销将非常大。
-
Standard tables are searched using a linear search.
标准表使用线性搜索查找数据。
-
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技术自动查找与给定查询有关的完整性约束条件，使得多个关系间连接操作的效率得到很大的提高；基于遗传算法的并行优化算法，深入研究了基于机群并行数据库中关系存储的选择、多连接查询优化和查询处理等关键技术。
-
As data object has been usually named in the one-dimensional space, the efficiency of traditional file system was very low to manage a large number of data object. After the linear hash Lookup algorithm has been adopted, the load factor controls splitting and merging.
由于数据对象是通常在一维空间中命名，传统文件系统管理大量数据对象的效率是极其低，采用线性哈希查找算法，由负载因子控制分裂和合并，与传统文件系统的树结构查找相比，哈希法查找时间复杂度为O(1)。
- 更多网络解释与线性查找相关的网络解释 [注：此内容来源于网络，仅供参考]
-
linear search：线性查找
linear scale 线性标度 | linear search 线性查找 | linear stochastic system 线性随机系统
-
Supervised：(监督分类)
、矢量、直方图查找表(Lut)、伪彩色表(Pct)快捷按钮提供了恢复原始影像(No Enhancement)、线性拉伸(Linear Enhancement)与自适应拉伸(Adaptive Enhancement)三种直方图拉伸算法;选择监督分类(Supervised)或非监督分类(Unsupervised);
-
Unsupervised：(非监督分类)
如下图:编辑影像、图形、矢量、直方图查找表(Lut)、伪彩色表(Pct)快捷按钮提供了恢复原始影像(No Enhancement)、线性拉伸(Linear Enhancement)与自适应拉伸(Adaptive Enhancement)三种直方图拉伸算法;选择监督分类(Supervised)或非监督分类(Unsupervised);上图选择监督分类