本文通过对Apriori算法分析，应用散列、事务压缩、划分、抽样等方法，最大可能的减少数据库扫描的次数，快速发现频繁项集，提高Apriori算法的效率。

This paper analyzes the Apriori algorithm, applies hashing, transaction compression, partitioning, sampling and other methods to minimize the number of database scans, quickly find frequent itemsets, and improve the efficiency of Apriori algorithm.