Abstract
There have been many studies on the design of P2P systems for effective keyword search. This paper proposes and tests technique to reduce network traffic due to many inverted lists forwarded in carrying out query containing multi-keywords in DHT base structured p2p network. Many of inverted lists, forwarded inter-medium, are discarded regardless of search result. This paper proposes Distance and Smart-bloom filter to diminish those unrelated inverted lists. Distance can correctly distinguish document not containing a certain keyword. Smart-bloom filter with low false positive rate can sort out document with a high chance of including certain keyword among inverted lists selected by distance. Ultimately large amount of unrelated inverted lists can be diminished. The performance of Distance and Smart-bloom filter was tested through simulation and the traffic was decreased by 67%.
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/
Google, http://www.google.com
Yahoo, http://www.yahoo.com
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., et al.: Chord: A scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM (2001)
Ratnasamy, S., et al.: A scalable content-addressable network. In: SIGCOMM’01 (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., et al.: Consistent Hashing and Random Trees: Tools for Relieving Hot Spots on the World Wide Web. In: Proceedings STOC, May 1997, pp. 654–663 (1997)
Yu, J., et al.: Making Peer-to-Peer Keyword Searching Feasible Using Multi-level Partitioning. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 151–161. Springer, Heidelberg (2005)
Bloom, B.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7), 422–426 (1970)
Bhattacharjee, B., et al.: Efficient peer-to-peer searches using result-caching. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Liu, L., Ryu, K.D., Lee, K.-W.: Keyword fusion to support efficient keyword-based search in peer-to-peer file sharing. In: CCGRID 2004, pp. 269–276 (2004)
Chou, J.C.Y., et al.: 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. In: CCGRID 2004, p. 274 (2004)
Yang, K.-H., Ho, J.-M.: Proof: A Novel DHT-based Peer-to-Peer Search Engine. IEICE Transactions on Communications E90-B(4), 817–825 (2007)
Lu, T., Sinha, S., Sudam, A.: Panache: A scalable distributed index for keyword search. Technical report, MIT (2002)
Ahmed, R., Boutaba, R.: Distributed Pattern Matching: A Key to Flexible and Efficient P2P Search. To appear in IEEE Journal on Selected Areas in Communications (JSAC) issue on Peer-to-Peer Communications and Applications, 1st Quarter (2007)
Jin, X., Yiu, W.-P.K., Chan, S.-H.G.: Supporting Multiple-keyword Search in a Hybrid Structured Peer-to-Peer Network. In: Proceedings of IEEE International Conference on Communications (ICC), Istanbul, Turkey, June 11-15 (2006)
Gopalakrishnan, V.: System support for keyword-based search in structured Peer-to-Peer systems. Dissertation, University of Maryland (August 2006)
Broder, A., Mitzenmacher, M.: Network Applications of Bloom Filters: A Survey. Internet Mathematics 1(4), 485–509 (2004)
Mitzenmacher, M.: Presentation: \Codes, Bloom Filters, and Overlay Networks, Cambridge, MA, 14 (2002)
Yang, Y., et al.: Performance of Full Text Search in Structured and Unstructured Peer-to-Peer Systems. In: IEEE INFOCOM, Barcelona (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Kim, B., Kim, K. (2007). Efficient Search Technique for Agent-Based P2P Information Retrieval. In: Gorodetsky, V., Zhang, C., Skormin, V.A., Cao, L. (eds) Autonomous Intelligent Systems: Multi-Agents and Data Mining. AIS-ADM 2007. Lecture Notes in Computer Science(), vol 4476. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72839-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-72839-9_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72838-2
Online ISBN: 978-3-540-72839-9
eBook Packages: Computer ScienceComputer Science (R0)