Implementation Detail: HUTMFI

• The MFI contains all maximally frequent itemsets found so far

• HUTMFI check whether inefficient if we search the complete MFI

• Good compromise: Search only a hot cache of the first 50 MFI entries

• Different caching strategies

• MFI is maintained itself as a set of bitmaps; fast subset checking