Skip to main content
SpringerLink
Log in
Book cover

Handbook of Peer-to-Peer Networking pp 405–426Cite as

Keyword Search in Unstructured Peer-to-Peer Networks

  • Chapter
  • First Online:

Abstract

Keyword search is a preliminary application for peer-to-peer (P2P) networks. It is important for users to find relevant resources in the highly dynamic system. Many factors affect the results of keyword search, including the underlying structure of peer-to-peer network, the dynamics of peers, the distribution of resources, etc.

This chapter introduces the methods used for keyword search in unstructured peer-to-peer networks, and further discusses their extensions for multi-keyword search. These methods can be categorized into two types. One is blind routing. Methods of this type do not consider the distribution of resources. Hence, they get the name of “blind routing”. These methods are typically robust. However, their network traffics are high. The other is routing indices. Methods of this type exploit the distribution of resources or query keywords. Therefore, they have low network traffic, especially for popular resources or queries.

For each method, an algorithm flow is presented, followed by an analysis of the pros and cons. A comparison is also made to demonstrate the differences between these methods.

At the end of this chapter, a discussion on extending the search methods to the multi-keyword search problem is held. The methods introduced in this chapter work differently in the multi-keyword search scenario. Some may need no adaption while some shall be modified for multi-keyword indices. The efficiencies of these methods in this problem are also considered and compared.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   349.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   449.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Androutsellis-Theotokis, S., Spinellis, D.: A survey of peer-to-peer content distribution technologies. ACM Computing Survey 36(4), 335–371 (2004). DOI http://doi.acm.org/10.1145/1041680.1041681

    Article  Google Scholar 

  2. Baeza-Yates, R.A., Ribeiro-Neto, B.: Modern Information Retrieval. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA (1999)

    Google Scholar 

  3. Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Communications of ACM 13(7), 422–426 (1970)

    Article  MATH  Google Scholar 

  4. Carlsson, B., Gustavsson, R.: The rise and fall of napster - an evolutionary approach. In: AMT ’01: Proceedings of the 6th International Computer Science Conference on Active Media Technology, pp. 347–354. Springer-Verlag, London, UK (2001)

    Google Scholar 

  5. Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: Making gnutella-like p2p systems scalable. In: SIGCOMM ’03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 407–418. ACM, New York, NY, USA (2003). DOI http://doi.acm.org/10.1145/863955.864000

  6. Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: ICDCS ’02: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS’02), p. 23. IEEE Computer Society, Washington, DC, USA (2002)

    Google Scholar 

  7. Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, pp. 120–130 (2004)

    Google Scholar 

  8. Jiang, S., Guo, L., Zhang, X.: Lightflood: an efficient flooding scheme for file search in unstructured peer-to-peer systems. In: Proceedings. 2003 International Conference on Parallel Processing, pp. 627–635 (2003)

    Google Scholar 

  9. Klemm, A., Lindemann, C., , Waldhorst, O.: Relating Query Popularity and File Replication in the Gnutella Peer-to-Peer Network. In: Proceedings 12th GI/ITG Conference on Measuring, Modelling and Evaluation of Computer and Communication Systems (MMB). Dresden, Germany (2004)

    Google Scholar 

  10. Kumar, A., Xu, J., Zegura, E.: Efficient and scalable query routing for unstructured peer-to-peer networks. INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE 2, 1162–1173 (2005)

    Google Scholar 

  11. Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: ICS ’02: Proceedings of the 16th international conference on Supercomputing, pp. 84–95 (2002)

    Google Scholar 

  12. Meng, S., Shi, C., Han, D., Zhu, X., Yu, Y.: A statistical study of todays gnutella. Lecture Notes in Computer Science 3841/2006, 189–200 (2006)

    Google Scholar 

  13. Milgram, S.: The small world problem. Psychology Today 2,60–67 (1967)

    Google Scholar 

  14. Mitchell, T.M.: Machine Learning. McGraw-Hill Higher Education (1997)

    Google Scholar 

  15. Ripeanu, M.: Peer-to-peer architecture case study: Gnutella network. p. 99. IEEE Computer Society, Los Alamitos, CA, USA (2001)

    Google Scholar 

  16. Ripeanu, M., Foster, I., Iamnitchi, A.: Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Computing Journal 6, 50–57 (2002)

    Google Scholar 

  17. Shi, C., Han, D., Liu, Y., Meng, S., Yu, Y.: A dynamic routing protocol for keyword search in unstructured peer-to-peer networks. Journal of Computer Communications 31(2), 318–331 (2008). DOI http://dx.doi.org/10.1016/j.comcom.2007.08.009

    Article  Google Scholar 

  18. Shi, C., Meng, S., Liu, Y., Han, D., Yu, Y.: Reinforcement learning for query-oriented routing indices in unstructured peer-to-peer networks. p2p 0, 267–274 (2006)

    Google Scholar 

  19. Tsoumakos, D., Roussopoulos, N.: Adaptive probabilistic search for peer-to-peer networks. In: P2P ’03: Proceedings of the 3rd International Conference on Peer-to-Peer Computing, p. 102. IEEE Computer Society, Washington, DC, USA (2003)

    Google Scholar 

  20. Tsoumakos, D., Roussopoulos, N.: Analysis and comparison of p2p search methods. In: InfoScale ’06: Proceedings of the 1st international conference on Scalable information systems, p. 25. ACM, New York, NY, USA (2006). DOI http://doi.acm.org/10.1145/1146847.1146872

Download references

Author information

Authors and Affiliations

  1. Apex Data & Knowledge Management Lab, Department of Computer Science & Engineering, Shanghai Jiao Tong University, 200240, 800 Dongchuan Road, Shanghai, China

    Dingyi Han & Yong Yu

Authors
  1. Dingyi Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yong Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dingyi Han .

Editor information

Editors and Affiliations

  1. Dept. Electrical & Computer Engineering, University of Waterloo, University Avenue W. 200, Waterloo, N2L 3G1, Canada

    Xuemin Shen

  2. Huawei Technologies, Somerset Corporate Blvd. 400, Bridgewater, 08807, U.S.A.

    Heather Yu

  3. Avaya Labs Research, Mount Airy Road 233, Basking Ridge, 07920, U.S.A.

    John Buford

  4. Dept. Electrical & Computer Engineering, University of Waterloo, University Avenue W. 200, Waterloo, N2L 3G1, Canada

    Mursalin Akon

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Han, D., Yu, Y. (2010). Keyword Search in Unstructured Peer-to-Peer Networks. In: Shen, X., Yu, H., Buford, J., Akon, M. (eds) Handbook of Peer-to-Peer Networking. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09751-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-09751-0_15

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-09750-3

  • Online ISBN: 978-0-387-09751-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation