提出了一种基于最小完美哈希函数的关联规则的挖掘算法。
An optimized direct hashing and pruning algorithm is proposed based on minimal perfect Hash scheme.
要写出一个完美的哈希函数是很困难的，特别是要处理哈希表中的冲突。
Perfecting hashing is difficult and to deal with that hashtable implementations support collision resolution.
要写出一个完美的哈希函数是很困难的，特别是要处理哈希表中的冲突。
Perfecting hashing is difficult and to deal with that hashtable implementations support collision resolution.
应用推荐