This article consists of five parts: search algorithm, flowchart, hash search function, heuristic search, and experimental results.
本文讨论散列算法中一种盐值的选取，并分析比较加与不加盐值所得到的不同的加密效果。
Every individual cell in the population has a grid position stored internally, so I don't have to search the grid or maintain an external hash when I want to find a cell's grid position.
种群中的每一个个体细胞都在内部存储了一个网格位置，所以，当我想要找到某个细胞的网格位置时，不必搜索网格或者维持一个外部散列表。
Perfect hash functions are time- and space-efficient implementations of static search sets.
完美散列函数是一种在时间和空间方面都十分高效的静态搜索集实现。
For each search in the %freedb_searches hash, the user adds more searches.
freedb_searches散列中的每一次检索，用户都会添加更多检索。
The method is called DigestSearch because it USES the unique digest (one-way hash) value to represent a search word.
该方法称作DigestSearch是因为它使用惟一摘要(单向散列)值来表示一个搜索字。
I use the data returned from the FreeDB search to make an anonymous hash with the appropriate elements.
我使用从FreeDB搜索中返回的数据来生成带有适当元素的匿名散列。
Twitter search results are returned in a hash reference with a page count and other fields besides the search results themselves.
Twitter搜索结果以一个散列引用的方式返回，除搜索结果本身外，还包含一个页面计数和其他字段。
This is unexpected because hash maps have constant time search whereas trees have log(n) search.
这很出乎意料，因为hashmap的搜索时间是常量，但trees的搜索时间却是log(n)。
In one example, the search for exact strings can be implemented by generating a hash value for the string, and then indexing this hash value.
在一个示例中，对精确字符串的搜索可以通过为字符串生成一个hash值，然后为这个hash值创建索引来实现。
The search results are saved into a hash map for sorting, categorizing, and filtering.
搜索结果被保存到一个散列映射中以进行排序、分类和筛选。
You can explicitly search for a known hash value with point ranges, in other words ranges with identical start and stop keys.
可以使用点范围(即开始键和终止键相同)显式地搜索一个已知的hash值。
Thus, the search in a large file using a hash index is faster than scanning the entire file.
因此，对于较大的文件，使用hash索引进行搜索比扫描整个文件更快。
The range producer computes the hash code for the given string to search for and returns a point range where the start and the end of the range is the hash code itself.
范围生成器计算给定字符串的hash码，以搜索并返回一个点范围，这个范围的起始值和终止值是hash码本身。
DHT (Distributed Hash Table) search algorithms is mainly adopted in the structured P2P network, it works fast and efficiently, but it is also limited by the network topology structure;
结构化P2P网络中主要采用分布式哈希（DHT）搜索算法，它查找速度快、效率高，但受网络拓扑结构的限制其应用有限；
At the actualization of the inner code table, the hash table and the sort search are integrated to improve the speed of searching character.
在输入法内部码表实现中，采用了哈希表与顺序查找相结合的方法，提高了字符的查找速度。
The system contains four main components:a feature acquisition module, a query manager, a search engine and a hash table.
系统包括四个主要部分：特征获取模块，查询管理模块，搜索引擎和一个散列表。
We use order preserving minimal perfect hash function to realize the search of terms library. It can not only upgrade the search speed, but also avoid sorting.
采用有序保留最小完全散列函数实现词库的查找，不但能加快查找速度，而且无需预先对单词排序。
Throughout the years, many kinds of data structure had been proposed and applied, for instance, hash tables, binary search tree, digital search tree, ternary search tree and so on and so forth.
在这些年间，有许多种不同的数据结构不断被提出和应用，例如哈希表、二分搜索树、数字查找树、三元搜索树等等。
Throughout the years, many kinds of data structure had been proposed and applied, for instance, hash tables, binary search tree, digital search tree, ternary search tree and so on and so forth.
在这些年间，有许多种不同的数据结构不断被提出和应用，例如哈希表、二分搜索树、数字查找树、三元搜索树等等。
应用推荐