Efficient Support of Conjunctive Queries in P2P DHT by using Bloom Filter

K. Kabatake, S. Tagashira, and S. Fujita (Japan)


P2P, DHT, Bloom filter, conjunctive query.


P2P DHT (Peer-to-Peer Distributed Hash Table) is a typi cal technique to realize an efficient keyword search in pure P2P systems. In this paper, we propose a new method to support conjunctive queries in P2P DHT. The basic idea of the proposed method is to cache the result of conjunctive queries to each peer, and to register the fact to the DHT. In addition, in order to reduce the number of meaningless queries to DHT, it registers cached conjunctions to Bloom filter, and circulates it among all peers. The effect of the proposed method is experimentally evaluated by simula tion. The result of experiments indicates that by using the proposed method, the amount of returned data reduces to 40%, and the number of queries reduces to 66%, compared with conventional P2P DHT.

Important Links:

Go Back