It presents an algorithm,converse index FP-tree,discovers the frequent itemsets through analysing converse FP-tree disadvantages,whose measures are found extending frequent itemsets and merging first subtree.At last discusses the properties of converse index FP-tree and realizing method is given.