We found that FP-tree can be used as an inverted indexing which can provide us a list of patterns containing a certain item.
we propose to modify FP-tree to store the frequent patterns for later fast retrieval.