FISM Procedure

reads input data in parallel when the data source is on a distributed system

supports the FP-growth algorithm, which is currently one of the fastest approaches to frequent item set mining

supports parallel implementation of the FP-growth algorithm in a distributed environment for faster performance

stores large databases in compact FP-tree format, which uses memory efficiently