Skip Navigation

IEICE Transactions on Information and Systems 2008 E91-D(4):1023-1031; doi:10.1093/ietisy/e91-d.4.1023
This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by KOBATAKE, K.
Right arrow Articles by FUJITA, S.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2008 The Institute of Electronics, Information and Communication Engineers

Regular Section -- Papers -- Computer Systems

A New Caching Technique to Support Conjunctive Queries in P2P DHT

Koji KOBATAKE1, Shigeaki TAGASHIRA2 and Satoshi FUJITA1

1 The authors are with the Graduate School of Engineering,Hiroshima University, Higashihiroshima-shi, 739–8527 Japan., 2 The author is with the Graduate School of Information Science and Electrical Engineering, Kyushu University, Fukuoka-shi, 819–0395 Japan. E-mail: shigeaki{at}f.csce.kyushu-u.ac.jp

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.

Key Words: P2P DHT, conjunctive query, result cache


Manuscript received June 11, 2007. Manuscript revised October 22, 2007.

Reference

[1] H. Balakrishnan, M.F. Kaashoek, D. Karger, R. Morris, and I. Stoica, "Looking up data in P2P systems," Commun. ACM, vol.46, no.2, pp.43–48, Feb. 2003.

[2] B. Bhattacharjee, S. Chawathe, V. Gopalakrishnan, P. Keleher, and B. Silaghi, "Efficient peer-to-peer searches using result-caching," Proc. 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03), pp.225–236, Feb. 2003.

[3] Metasearch Search Engine, http://www.search.com

[4] Text REtrieval Conference (TREC) Home Page, http://trec.nist.gov

[5] I. Clarke, O. Sandberg, B. Wiley, and T.W. Hong, "Freenet: A distributed anonymous information storage and retrieval systems," Proc. ICSI Workshop on Design Issues in Anonymity and Unobservability, pp.46–66, July 2000.

[6] O. Gnawali, A Keyword-Set Search System for Peer-to-Peer Networks, Master's Thesis, Massachusetts Institute of Technology, June 2002.

[7] Gnutella, http://gnutella.wego.com/

[8] R. Hasan, Z. Anwar, W. Yurcik, L. Brumbaugh, and R. Campbell, "A survey of peer-to-peer storage techniques for distributed file systems," Proc. IEEE International Conference on Information Technology: Coding and Computing (ITCC'05), pp.205–213, April 2005.

[9] L. Liu, K.D. Ryu, and K.W. Lee, "Keyword fusion to support efficient keyword-based search in peer-to-peer file sharing," Proc. 4th International Workshop on Global and Peer-to-Peer Computing, pp.269–276, April 2004.

[10] Napster, http://www.napster.com/

[11] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content addressable network," Proc. ACM SIGCOMM 2001, pp.161–172, Aug. 2001.

[12] P. Reynolds and A. Vahdat, "Efficient peer-to-peer keyword searching," Proc. 4th ACM/IFIP/USENIX International Middleware Conference, pp.21–40, June 2003.

[13] A. Rowstron and P. Druschel, "Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems," Proc. 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pp.329–350, Nov. 2001.

[14] I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for Internet applications," Proc. ACM SIGCOMM 2001, pp.149–160, Aug. 2001.

[15] B.Y. Zhao, J.D. Kubiatowicz, and A.D. Joseph, "Tapestry: An infrastructure for fault-tolerant wide-area location and routing," IEEE J. Sel. Areas Commun., vol.22, no.1, pp.41–53, Jan. 2003.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by KOBATAKE, K.
Right arrow Articles by FUJITA, S.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?