随着为元素指定的属性个数的增加，平均查找时间也将增加。
As the number of attributes specified for an element increases, so does the average search time.
如果执行时间加上查找时间，便会获得全部的存取时间。
If you add seek time to latency, you get the total access time.
一个12 - MB的数据库的读入、装载和查找时间增加到一分钟。
For a 12-mb database, the read-load-find time jumps to well over a minute.
同时，最坏情况下算法的查找时间和更新复杂度基本没有改变。
After being compressed, the algorithm's time and update complexity do not change much under the worst condition.
实验表明，在查找时间和存储空间上新算法的性能都有明显的提高。
The experiments show that the new algorithm improves search time and storage space performance significantly.
IsValidCommandLineOption的查找时间复杂度为o (1)。
IsValidCommandLineOption has a lookup time complexity of o (1).
根据故障指示代码就可以确定故障原因，这样一来就缩小了故障查找范围，大大减少故障查找时间。
According to the fault indicator code can determine the cause of the problem, thus narrowing the scope of the troubleshooting, greatly reduce troubleshooting time.
研究发现快速包分类算法EGT-PC由于压缩特里树路径带来规则集的大量冗余备份降低了算法的查找时间和存储空间等性能。
This paper found out the fast packet classification algorithm EGT-PC's search time and storage space performance were decreased by the rules' redundant copies.
perfectproperty：查找时间复杂度为o(1)的表条目—就是说，至多需要一个字符串比较执行静态搜索集中的关键字识别。
Perfect property: Locating a table entry requires o (1) time-that is, at most, one string comparison is required to perform keyword recognition within the static search set.
和其它的提供了最坏情况O（logn）查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。
Unlike other self-balancing binary search trees that provide worst case O(log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.
和其它的提供了最坏情况O（logn）查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。
Unlike other self-balancing binary search trees that provide worst case O(log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.
应用推荐