哈希非常类似于指纹，通过构建哈希算法，即使是源中的最小更改也会产生完全不同和不可预知的哈希值。
A hash is very much like a fingerprint and the hash algorithm is constructed so that the smallest change in the source produces a completely different and unpredictable hash value.
最小的表首先被扫描，然后哈希表被填入相匹配的每个键的行指针。
The smallest table is scanned first, and the hash table is populated with Pointers to the rows that match each key.
提出了一种基于最小完美哈希函数的关联规则的挖掘算法。
An optimized direct hashing and pruning algorithm is proposed based on minimal perfect Hash scheme.
提出了一种基于最小完美哈希函数的关联规则的挖掘算法。
An optimized direct hashing and pruning algorithm is proposed based on minimal perfect Hash scheme.
应用推荐