在满足筛选器条件的每个行中，数据库服务器将对键应用哈希函数，并探测哈希表以查找匹配的键值。

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.

youdao

要写出一个完美的哈希函数是很困难的，特别是要处理哈希表中的冲突。

Perfecting hashing is difficult and to deal with that hashtable implementations support collision resolution.

youdao

可以在概念上将哈希表认为是一系列的 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.

youdao