Efficient Processing of Conjunctive Queries in P2P DHTs Using Bloom Filter

In this paper, we propose a distributed algorithm to process conjunctive queries in P2P DHTs. The basic idea of the proposed scheme is to cache the search result for past conjunctive queries, and to use them to improve the efficiency of the succeeding query processing. As a concrete implementation of such result cache, we adopt Bloom filter in such a way that the cache size required for each query becomes as large as the size of each file index. The performance of the proposed scheme is evaluated by simulation. The result of simulations indicates that the proposed scheme is particularly effective for P2P DHTs with small storage size, and it reduces the amount of data transmissions to process given conjunctive queries by 49.7% compared with previous schemes.