Aimed at consuming a large numbers of memory when constructing FP-tree, the algorithm CCFP (constraint clip FP-tree) is put forward which utilizes items' presence and absence constraint to clip transaction database in order to create briefFP-Tree, and after scanning the database again, gets association rule. The experiment shows that the algorithm occupies less memory than ordin...