顺序查找

用传统的手工索引和顺序查找方法在大量的视频数据中查找所需的视频片断是一项繁琐且耗时的工作，很难满足视频数据库的性能需求。

To search for required fragments among huge quantity of video is a tedious and time consuming task for traditional manual indexing and sequential searching methods which certainly can not meet the performance requirements of video databases .

其中，Linux内核中基于顺序查找算法实现规则匹配的方式，在规则数增加时，尤其是企业级防火墙和核心路由器的应用环境中，将导致其性能急剧下降。

As is known to all , linux implemented firewall based on linear searching algorithm . With the increasing of the number of rules , especially in the scenes of enterprise firewall or a core router , the performance of this algorithm will dramatically decrease .

你可以根据字母顺序查找这些文件。

You can consult the files according to the alphabetic order .

一个可能是简单的顺序查找，而另一个可能就是使用索引的那个。

One possibility is a simple sequential scan and the other possibility is to use the index .

另一方面，大量过滤规则的顺序查找导致了防火墙吞吐量下降。

On the other hand , the ordinal lookup of filtering rules in firewall results in decrease of throughput .

本文结合单片机应作实例着重分析了三种查找算法&顺序查找、折半查找和分块查找的查找思想和查找效率。

This paper illustrates the three searching methods-sequential search , binary search and blocking search and analyses searching theories and searching efficiency .

在实际检索中，存在着特征匹配结果不能完全反映用户的语义要求，在海量图像数据库中顺序查找效率过低等问题。

In fact , there are the follow problems . The matching character results can 't reflect the user 's semantic requirements completely .

该算法不仅高效，克服了顺序查找算法速度慢、效率低的不足，而且答疑库的规模对查询平均时间影响很小，提高了系统查询的速度。

And the average search time of this algorithm is unremarkably affected by the size of the corpora over that of other algorithms .

提出了采用B+树实现密文索引的方法以支持动态结构调整和顺序查找。

This article puts forward a method to implement the ciphertext index to support dynamic structure modification and sequential query by using B + tree .

如果正在浏览页面的用户在本地没有该列表上的第一种字体，则将按顺序查找替代字体，直至找到匹配项为止。

If the first font in the list is not available locally to a user who is browsing your page , fonts are substituted sequentially until a match is found .

本文主要实现了二叉树的图形处理算法、无序表顺序查找改进算法及非递归建立二叉树算法等，并对算法进行了分析。

This article mainly implements following algorithms : two forks tree 's graph processing algorithm , unordered list sequence search improved algorithm , the non-recursion established two forks tree and so on , and carries on the analysis to its algorithm .

查找基于排序顺序来查找行，但未指定任何排序顺序。

Find finds a row based on a Sort order , and no Sort order is specified .

按顺序地查找订户的记录很象从电话簿的第一页开始逐页逐行地查找某个电话号码一样，这不是我们使用电话簿的方法。

Searching for that subscriber 's record sequentially is like looking for a telephone number by starting with the first page of the telephone book and reading line by line . that 's not how we use a telephone book .

策略顺序确定在系统查找成本数据的次序。

The strategy sequence determines the order in which the system searches for costing data .

于是，按照“由简至难”的顺序进行了逐步查找；

Thus , in accordance with the " from simple to difficult " step by step in order to carry out the search ;