Fast frequent itemsets generation and Support calculation with FPGAs

Frequent Itemsets are the sets that most likely occurring together. This paper propose a high efficient implementation for frequent itemsets generation and Support calculation based on a systolic array architecture through only one scan of the database. A parallel item-delivering method is introduced to accelerate the generation procedure. Analysis of simulation results illustrates that our method is much more efficient than the software algorithm and other hardware implementations.