We showed how the best features of the two proposed algorithms can be combined into a hybrid
algorithm, called AprioriHybrid, which then becomes the algorithm of choice for this problem.
Scale-up experiments showed that AprioriHybrid scales linearly with the number of transactions.
In addition, the execution time decreases a little as the number of items in the database increases.
As the average transaction size increases (while keeping the database size constant), the execution
time increases only gradually. These experiments demonstrate the feasibility of using AprioriHybrid
in real applications involving very large databases.