Arrays and bit operation are adopted by the algorithm,the database will not be scanned for many times and the enormous candidate itemsets will not be produced.

• 该算法采用简单的数组和位运算,在执行关联规则的更新时,既不用多次扫描数据库,也不产生庞大的候选项集。