Although the size of the power-set grows exponentially in the number of items formula_3 in formula_6, efficient search is possible using the downward-closure property of support (also called "anti-monotonicity") which guarantees that for a frequent itemset, all its subsets are also frequent and thus no infrequent itemset can be a subset of a frequent itemset.