RESEARCH OF THE EFFICIENCY OF THE APRIORI GROUP ALGORITHMS ON DIFFERENT DATABASE SIZES

Abstract

The results of the work analysis of associative rule search algorithms for handling Big data are presented in the paper. The most famous modifica-tions of Apriori algorithms for finding associative rules are considered. The re-sults of the research of the efficiency of linear algorithms Apriori and Apriori-TID on the data of different volumes using computers with standard RAM vol-ume are presented. The feasibility of using the AIS algorithm and its parallel implementation on the Hadoop MapReduce framework is substantiated. A comparison of the linear implementation of the AprioriTID algorithm and the parallel implementation of the AIS algorithm is provided. The conclusions about the effectiveness of using a parallel algorithm to solve a formulated prob-lem was given.