Abstract: Discovering frequent itemsets is a key problem in data mining applications and the high cost of the process leads to the need for incremental data mining algorithms The difficulty of incremental updating frequent itemsets is analyzed and pointed out, and a fast algorithm FUFIA is put forward to find new frequent itemsets Finally, the analysis and discussion on this algorithm are also presented