Description

In wide area network, Peer-to-Peer multi keyword searching requires distributed intersection/union operation. During this operation traffic cost is raised. In existing , Bloom filter encoding is used to reduce the traffic cost. In this paper, mathematical proof is used to define the problem of optimal setting. Through mathematical proof, that the optimal setting of BF in terms of traffic cost is determined by the statistical information of the involved inverted lists, not the minimized false positive rate as claimed by previous studies. Through numerical analysis, we demonstrate how to obtain optimal settings. To better evaluate the performance of this design, we conduct comprehensive simulations on TREC WT10G test collection and query logs of a major commercial web search engine. Results show that our design significantly reduces the search traffic and latency of the existing approaches.