By Topic

Efficient Processing of Conjunctive Queries in P2P DHTs Using Bloom Filter

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ariyoshi, T. ; Dept. of Inf. Eng., Hiroshima Univ., Hiroshima, Japan ; Fujita, S.

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.

Published in:

Parallel and Distributed Processing with Applications (ISPA), 2010 International Symposium on

Date of Conference:

6-9 Sept. 2010