Abstract: In this paper, tow main shortcomings of a conventional hash algorithm used for finding frequent item sets in data mining are pointed out： 1） it is difficult to choose a suitable hash function; 2） it is easy to lead to a hash conflict. In order to overcome

Key words: Data mining, Frequent item sets, Hash function, Hash conflict, Separate agilely into buckets