Search optimization of P2P system based on SFP-tree
Mei Liu · Journal of Sichuan University · 2009
To realize the rapidly search and load balance of file sharing in Peer to Peer system,this paper proposes the supplemental frequent pattern based sites distribution method to response share queries. The main contents include:(1) proposing the conception of full transaction,supplemental frequent pattern along with the structure of SFP-Tree.To a item set B with high support count,each item not being frequent with B but relative frequent (arrive to the share support threshold) becomes the supplemental item of B,and a frequent item set X including B can attract some supplemental items of B to form an item set with enough items.This type of item set is long enough and efficient enough for providing the partitions of relative file synchronously.(2) giving the method of supplemental frequent pattern mining using AFP-Tree,CMP-Tree and SFP-Tree,and (3) executing simulation experiment to test the efficiency of SFP-Tree based supplemental frequent pattern mining,the result shows that SFP-Tree bases method can realize the supplemental frequent pattern mining in 20 seconds to a query response transaction with 100,000 transactions.