A New Caching Technique to Support Conjunctive Queries in P2P DHT
Summary :
P2P DHT (Peer-to-Peer Distributed Hash Table) is one of typical techniques for realizing an efficient management of shared resources distributed over a network and a keyword search over such networks in a fully distributed manner. In this paper, we propose a new method for supporting conjunctive queries in P2P DHT. The basic idea of the proposed technique is to share a global information on past trials by conducting a local caching of search results for conjunctive queries and by registering the fact to the global DHT. Such a result caching is expected to significantly reduce the amount of transmitted data compared with conventional schemes. The effect of the proposed method is experimentally evaluated by simulation. The result of experiments indicates that by using the proposed method, the amount of returned data is reduced by 60% compared with conventional P2P DHT which does not support conjunctive queries.
- Publication
- IEICE TRANSACTIONS on Information Vol.E91-D No.4 pp.1023-1031
- Publication Date
- 2008/04/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1093/ietisy/e91-d.4.1023
- Type of Manuscript
- PAPER
- Category
- Computer Systems
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
Koji KOBATAKE, Shigeaki TAGASHIRA, Satoshi FUJITA, "A New Caching Technique to Support Conjunctive Queries in P2P DHT" in IEICE TRANSACTIONS on Information,
vol. E91-D, no. 4, pp. 1023-1031, April 2008, doi: 10.1093/ietisy/e91-d.4.1023.
Abstract: P2P DHT (Peer-to-Peer Distributed Hash Table) is one of typical techniques for realizing an efficient management of shared resources distributed over a network and a keyword search over such networks in a fully distributed manner. In this paper, we propose a new method for supporting conjunctive queries in P2P DHT. The basic idea of the proposed technique is to share a global information on past trials by conducting a local caching of search results for conjunctive queries and by registering the fact to the global DHT. Such a result caching is expected to significantly reduce the amount of transmitted data compared with conventional schemes. The effect of the proposed method is experimentally evaluated by simulation. The result of experiments indicates that by using the proposed method, the amount of returned data is reduced by 60% compared with conventional P2P DHT which does not support conjunctive queries.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e91-d.4.1023/_p
Copy
@ARTICLE{e91-d_4_1023,
author={Koji KOBATAKE, Shigeaki TAGASHIRA, Satoshi FUJITA, },
journal={IEICE TRANSACTIONS on Information},
title={A New Caching Technique to Support Conjunctive Queries in P2P DHT},
year={2008},
volume={E91-D},
number={4},
pages={1023-1031},
abstract={P2P DHT (Peer-to-Peer Distributed Hash Table) is one of typical techniques for realizing an efficient management of shared resources distributed over a network and a keyword search over such networks in a fully distributed manner. In this paper, we propose a new method for supporting conjunctive queries in P2P DHT. The basic idea of the proposed technique is to share a global information on past trials by conducting a local caching of search results for conjunctive queries and by registering the fact to the global DHT. Such a result caching is expected to significantly reduce the amount of transmitted data compared with conventional schemes. The effect of the proposed method is experimentally evaluated by simulation. The result of experiments indicates that by using the proposed method, the amount of returned data is reduced by 60% compared with conventional P2P DHT which does not support conjunctive queries.},
keywords={},
doi={10.1093/ietisy/e91-d.4.1023},
ISSN={1745-1361},
month={April},}
Copy
TY - JOUR
TI - A New Caching Technique to Support Conjunctive Queries in P2P DHT
T2 - IEICE TRANSACTIONS on Information
SP - 1023
EP - 1031
AU - Koji KOBATAKE
AU - Shigeaki TAGASHIRA
AU - Satoshi FUJITA
PY - 2008
DO - 10.1093/ietisy/e91-d.4.1023
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E91-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 2008
AB - P2P DHT (Peer-to-Peer Distributed Hash Table) is one of typical techniques for realizing an efficient management of shared resources distributed over a network and a keyword search over such networks in a fully distributed manner. In this paper, we propose a new method for supporting conjunctive queries in P2P DHT. The basic idea of the proposed technique is to share a global information on past trials by conducting a local caching of search results for conjunctive queries and by registering the fact to the global DHT. Such a result caching is expected to significantly reduce the amount of transmitted data compared with conventional schemes. The effect of the proposed method is experimentally evaluated by simulation. The result of experiments indicates that by using the proposed method, the amount of returned data is reduced by 60% compared with conventional P2P DHT which does not support conjunctive queries.
ER -
English
