• lubna yusufi
• rahul moriwal
• amit khare

FP-growth method is a efficient algorithm to mine frequent patterns, in spite of long or short frequent patterns. By using compact tree structure and partitioning-based, divide-and-conquer searching method, it reduces the search costs substantially. But just as the analysis in Algorithm , in the process of FP-tree construction, it is a strict serial computing process. algorithm performance is related to the database size, the sum of frequent patterns in the database: ω. this is a serious bottleneck. People may think using distributed parallel computation technique or multi-CPU to solve this problem. But these methods apparently increase the costs for exchanging and combining control information, and the algorithm complexity is also greatly increased, cannot solve this problem efficiently. Even if adopting multi-CPU technique, raising the requirement of hardware, the performance improvement is still limited.

"Performance of Frequent Pattern-Growth hierarchy for bulky and forceful Data Set and advance effectiveness ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.7, Issue 4, page no.1026-1032, April-2020, Available :http://www.jetir.org/papers/JETIR2004139.pdf

"Performance of Frequent Pattern-Growth hierarchy for bulky and forceful Data Set and advance effectiveness ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.7, Issue 4, page no. pp1026-1032, April-2020, Available at : http://www.jetir.org/papers/JETIR2004139.pdf