期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2013
卷号：4
期号：4
页码：326-329
语种：English
出版社：Ayushmaan Technologies
摘要：An aspect of P2P fles Distribution applications are used millionsof end users. At the same time in p2p multi way searching requiressome distributed operations union and intersection. In this wayraising bulky amount of traffc cost and it give unsatisfactoryresults. Here also utilize the concept of Bloom Filter .It’s reallyreduce the traffc cost during the condition of applying union andintersection operations but not utilize in the proper way of theconcept of Bloom Filter. That’s way in this paper we totally focuson most effective use of Bloom Filter Settings in p2p N-keywordSearching procedure. We also give some algebraic concepts in theway of the most effective use of BF settings in terms of fallingthe traffc cost. The involved reversed lists, not the minimizedfalse positive rate as right by previous studies. For the betterevaluate the performance of this aim, we perform inclusive onText retrieval conference WT10G test collection and query logsof a major commercial web search engine. It is highly useful forsignifcantly reduces the search traffc, latency and maximumgives good results of the earlier approaches.
