IEICE TRANSACTIONS on Information
A Memory Efficient Result Cache Scheme for P2P DHT Based on Bloom Filters
Summary :
In this paper, we study the problem of efficient processing of conjunctive queries in Peer-to-Peer systems based on Distributed Hash Tables (P2P DHT, for short). The basic idea of our approach is to cache the search result for the queries submitted in the past, and to use them to improve the performance of succeeding query processing. More concretely, we propose to adopt Bloom filters as a concrete implementation of such a result cache rather than a list of items used in many conventional schemes. By taking such an approach, the cache size for each conjunctive query becomes as small as the size of each file index. The performance of the proposed scheme is evaluated by simulation. The result of simulation indicates that the proposed scheme is particularly effective when the size of available memory in each peer is bounded by a small value, and when the number of peers is 100, it reduces the amount of data transmissions of previous schemes by 75%.
- Publication
- IEICE TRANSACTIONS on Information Vol.E94-D No.8 pp.1602-1609
- Publication Date
- 2011/08/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E94.D.1602
- Type of Manuscript
- PAPER
- Category
- Information Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Takahiro ARIYOSHI, Satoshi FUJITA, "A Memory Efficient Result Cache Scheme for P2P DHT Based on Bloom Filters" in IEICE TRANSACTIONS on Information,
vol. E94-D, no. 8, pp. 1602-1609, August 2011, doi: 10.1587/transinf.E94.D.1602.
Abstract: In this paper, we study the problem of efficient processing of conjunctive queries in Peer-to-Peer systems based on Distributed Hash Tables (P2P DHT, for short). The basic idea of our approach is to cache the search result for the queries submitted in the past, and to use them to improve the performance of succeeding query processing. More concretely, we propose to adopt Bloom filters as a concrete implementation of such a result cache rather than a list of items used in many conventional schemes. By taking such an approach, the cache size for each conjunctive query becomes as small as the size of each file index. The performance of the proposed scheme is evaluated by simulation. The result of simulation indicates that the proposed scheme is particularly effective when the size of available memory in each peer is bounded by a small value, and when the number of peers is 100, it reduces the amount of data transmissions of previous schemes by 75%.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E94.D.1602/_p
Copy
@ARTICLE{e94-d_8_1602,
author={Takahiro ARIYOSHI, Satoshi FUJITA, },
journal={IEICE TRANSACTIONS on Information},
title={A Memory Efficient Result Cache Scheme for P2P DHT Based on Bloom Filters},
year={2011},
volume={E94-D},
number={8},
pages={1602-1609},
abstract={In this paper, we study the problem of efficient processing of conjunctive queries in Peer-to-Peer systems based on Distributed Hash Tables (P2P DHT, for short). The basic idea of our approach is to cache the search result for the queries submitted in the past, and to use them to improve the performance of succeeding query processing. More concretely, we propose to adopt Bloom filters as a concrete implementation of such a result cache rather than a list of items used in many conventional schemes. By taking such an approach, the cache size for each conjunctive query becomes as small as the size of each file index. The performance of the proposed scheme is evaluated by simulation. The result of simulation indicates that the proposed scheme is particularly effective when the size of available memory in each peer is bounded by a small value, and when the number of peers is 100, it reduces the amount of data transmissions of previous schemes by 75%.},
keywords={},
doi={10.1587/transinf.E94.D.1602},
ISSN={1745-1361},
month={August},}
Copy
TY - JOUR
TI - A Memory Efficient Result Cache Scheme for P2P DHT Based on Bloom Filters
T2 - IEICE TRANSACTIONS on Information
SP - 1602
EP - 1609
AU - Takahiro ARIYOSHI
AU - Satoshi FUJITA
PY - 2011
DO - 10.1587/transinf.E94.D.1602
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E94-D
IS - 8
JA - IEICE TRANSACTIONS on Information
Y1 - August 2011
AB - In this paper, we study the problem of efficient processing of conjunctive queries in Peer-to-Peer systems based on Distributed Hash Tables (P2P DHT, for short). The basic idea of our approach is to cache the search result for the queries submitted in the past, and to use them to improve the performance of succeeding query processing. More concretely, we propose to adopt Bloom filters as a concrete implementation of such a result cache rather than a list of items used in many conventional schemes. By taking such an approach, the cache size for each conjunctive query becomes as small as the size of each file index. The performance of the proposed scheme is evaluated by simulation. The result of simulation indicates that the proposed scheme is particularly effective when the size of available memory in each peer is bounded by a small value, and when the number of peers is 100, it reduces the amount of data transmissions of previous schemes by 75%.
ER -
English
