Abstract: A tree structure algorithm based on vertical tid-list to resolve the frequent itemsets program in Apriori is put forward.The algorithm combines the ordinal character of itemsets and makes the nodes ascending order by support count in the tree，so the sets of the candidate frequent itemsets is the least totally.The algorithm can greatly reduce the candidate frequent itemsets，keep the completion of frequent itemsets，reduce the cost of computing，and improve the efficiency of algorithm.