
180
CHAPTER
3 Programming for Performance
computing the candidate list Q requires only examining all pairs of these itemsets.
Since each itemset has its list of transactions attached, the size of each resulting
itemset in
C]
z
can be computed at the same time as constructing the C^ itemset itself
from a pair of Lfc_
x
itemsets, by simply computing the intersection of the transac-
tions in that pair's lists.
EXAMPLE 3.4 Suppose {AB
f
1, 3, 5, 8, 9} and {AC, 2, 3, 4, 8, 10} are large itemsets of
size two in the same one-equivalence class (they each start with A). How will the
data be accessed in disk and memory?
Answer The list of transactions tha ...