在满足筛选器条件的每个行中，数据库服务器将对键应用哈希函数，并探测哈希表以查找匹配的键值。
For each row that satisfies the filter condition, the database server applies hash function to the key and proves the hash table to find a match.
要写出一个完美的哈希函数是很困难的，特别是要处理哈希表中的冲突。
Perfecting hashing is difficult and to deal with that hashtable implementations support collision resolution.
可以在概念上将哈希表认为是一系列的 bucket，每个 bucket 所拥有的地址是通过应用哈希函数从键值导出的。
You can think of a hash table conceptually as a series of buckets, each with an address that is derived form the key value by applying the hash function.
哈希函数：哈希表使用的一种函数，能计算出一个键的位置。
A function used by a hashtable to compute the location for a key.
当在派生类中被重写时，用作指定对象的哈希算法和数据结构(如哈希表)的哈希函数。
When overridden in a derived class, serves as a hash function for the specified object for hashing algorithms and data structures, such as a hash table.
用作特定类型的哈希函数，适合在哈希算法和数据结构(如哈希表)中使用。
Serves as a hash function for a particular type, suitable for use in hashing algorithms and data structures such as a hash table.
用作特定类型的哈希函数，适合在哈希算法和数据结构(如哈希表)中使用。
Serves as a hash function for a particular type, suitable for use in hashing algorithms and data structures such as a hash table.
应用推荐