The classical algorithm of association rules (such as Apriori algorithm) is a serial algorithm, when the data volume is relatively large, mining efficiency is low. A new parallel BVP algorithm is proposed. The BVP algorithm reads data from multiple threads and calculates the corresponding data. Then, the frequent itemsets and association rules are computed. Experimental results show that the algorithm is more efficient than the classical Apriori algorithm.