Abstract
DHT(Distributed Hash Table) provides a very effective and reliable search scheme in P2P networks. However, when the search involves a multiple-keyword query, it suffers heavy network traffic due to the passing around of a large inverted list among P2P nodes. In this paper, we propose Distance-Based Pruning technique to cut down the size of the inverted list considerably. It utilizes the concept of distance between keywords in the query and removes those entries in the inverted list that are going to be dropped sooner or later. We prove this prediction is accurate and effective such that it reduces the size of the inverted list by 29%.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
The Gnutella Protocol Specification v0.41 Document Revision 1.2., http://rfc-gnutella.sourceforge.net/developer/stable/index.html
Kazza, http://www.kazza.com
Reynolds, P., Vahdat, A.: Efficient Peer-to-Peer Keyword Searching. In: Endler, M., Schmidt, D.C. (eds.) Middleware 2003. LNCS, vol. 2672, Springer, Heidelberg (2003)
Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM (2001)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: SIGCOMM 2001 (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, Springer, Heidelberg (2001)
Zhao, B.Y., Kubatowicz, J., Joseph, A.: Tapestry: an infrastructure for fault-tolerant wide-area location and routing, Tech. Rep. UCB/CSD-01-1141, University of California at Berkeley (April 2001)
Karger, D., Lehman, E., Leighton, T., Levine, M., Lewin, D., Panigrahy, R.: Consistent Hashing and Random Trees: Tools for Relieving Hot Spots on the World Wide Web. In: Proceedings STOC, pp. 654–663 (May 1997)
Bloom, B.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7), 422–426 (1970)
Shi, S., Yang, G., Wang, D., Yu, J., Qu, S., Chen, M.: Making Peer-to-Peer Keyword Searching Feasible Using Multi-Level Partitioning. In: IPTPS (2004)
Bhattacharjee, B., Chawathe, S., Gopalakrishnan, V., Keleher, P., Silaghi, B.: Efficient peer-to-peer searches using result-caching. In: The 2nd International Workshop on Peer-to-Peer Systems(IPTPS 2003) (2003)
Liu, L., Ryu, K.D., Lee, K-W.: Keyword fusion to support efficient keyword-based search in peer-to-peer file sharing, CCGRID 2004, pp. 269–276 (2004)
Jerry, C., Chou, Y., Huang, T.-Y., Huang, K.-L., Chen, T.-Y.: SCALLOP: A Scalable and Load-Balanced Peer-to-Peer Lookup Protocol. IEEE Trans. Parallel Distrib. Syst. 17(5), 419–433 (2006)
Gnawali, O.: A Keyword Set Search System for Peer-to-Peer Networks, Master’s thesis, Massachusetts Institute of Technology (2002)
Tang, C., Dwarkadas, S.: Hybrid Global-Local Indexing for Efficient Peer-to-Peer Information Retrieval. In: Proceedings of the Symposium on Networked Systems Design and Implementation (NSDI) (June 2004)
Gulati, A., Ranjan, S.: Efficient Keyword Search using Multicast Trees in Structured p2p Networks submitted to Middleware (2005)
Tang, C., Xu, Z., Dwarkadas, S.: Peer-to-Peer Information Retrieval Using Self-organizing Semantic Overlay Networks. In: Proceedings of SIGCOMM (2003)
The Chord Simulator, http://pdos.csail.mit.edu/chord/sim.html and http://cvs.pdos.csail.mit.edu/cvs/~checkout/~sfsnet
Liu, L., Ryu, K.D., Lee, K.-W.: Keyword fusion to support efficient keyword-based search in peer-to-peer file sharing, CCGRID 2004, p. 274 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, B., Kim, K. (2007). Keyword Search in DHT-Based Peer-to-Peer Networks. In: Jin, H., Rana, O.F., Pan, Y., Prasanna, V.K. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2007. Lecture Notes in Computer Science, vol 4494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72905-1_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-72905-1_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72904-4
Online ISBN: 978-3-540-72905-1
eBook Packages: Computer ScienceComputer Science (R0)