Application of Improved Apriori Algorithm in Computer database Management System

In order to improve the efficiency of association rule mining algorithm, an improved Apriori algorithm is proposed in the computer database management system. On the basis of theoretical knowledge, the classical Apriori algorithm for mining association rules is deeply analyzed. According to the characteristics of mining association rules in relational databases, a new coding algorithm - Apriori coding is proposed, and the implementation steps are described in detail from two aspects of theory and process. The experimental results show that under different minimum critical value, the first 30000 records in the database are used for association rule mining. Minimum critical value for Sup are set to 5%, 10%, 15%, 20% and 25% respectively. When the minimum support critical value is small, the execution time of the encoded Apriori algorithm is far less than that of the traditional Apriori algorithm. Select the first 5000, 10000, 15000, 20000, 25000 and 30000 records from the database, and minimum critical value=20%.The Apriori coding algorithm is more efficient than the traditional Apriori algorithm, especially when the number of records in the database is large. The coding of Apriori algorithm is compared with that of Apriori algorithm, which verifies the effectiveness and superiority of the improved algorithm.