Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Peer-to-Peer Full-Text Keyword Search of the Web

  • Conference paper
  • First Online:
Networked Systems (NETYS 2015)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 9466))

Included in the following conference series:

  • 581 Accesses

Abstract

Full-text keywords search of the Web over structured peer-to-peer networks shows promise to become an alternative to the state-of-the-art search engines since P2P overlays propose means for decentralized search across widely-distributed document collections. However, a disadvantage of structured P2P systems is that they consider only the problem of searching for keys, and thus cannot perform content-based retrieval. To deal with this problem, in this paper we consider a full-text retrieval problem in structured P2P networks. Our keyword searching engine BI-Chord is build on top of DHT-based P2P systems, entirely distributed, uses bloom filters and inverted index and therefore scales well with the size of the network. Experimental results show that our mechanism is efficient, scalable and provides high quality of search results, i.e. the precision and recall metrics.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

References

  1. Omnet++ community site. http://www.omnetpp.org. Accessed January 2015

  2. The oversim p2p simulator. http://www.oversim.org/. Accessed January 2015

  3. Rowstron, A., Druschel, P.: Pastry: scalable, decentralized object location and routing for large-scale p2p systems. In: IFIP/ACM Middleware (2001)

    Google Scholar 

  4. Baumgart, I., Heep, B., Krause, S.: Oversim: a flexible overlay network simulation framework. In: Proceedings of 10th IEEE Global Internet Symposium in Conjunction with IEEE INFOCOM, Anchorage, AK, USA (2007)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  6. Chen, H., Jin, H., Chen, L., Liu, Y., Ni, L.M.: Optimizing bloom filter settings in peer-to-peer multikeyword searching. IEEE Trans. Knowl. Data Eng. 24(4), 692–706 (2012)

    Article  Google Scholar 

  7. Chen, H., Jin, H., Luo, X., Liu, Y., Gu, T., Chen, K., Ni, L.M.: Bloomcast: efficient and effective full-text retrieval in unstructured p2p networks. IEEE Trans. Parallel Distrib. Syst. 23, 232–241 (2012)

    Article  Google Scholar 

  8. Chen, H., Yan, J., Jin, H., Liu, Y., Ni, L.M.: Tss: efficient term set search in large peer-to-peer textual collections. IEEE Trans. Comput. 59, 969–980 (2010)

    Article  MathSciNet  Google Scholar 

  9. Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: a distributed anonymous information storage and retrieval system. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, p. 46. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Cuenca-Acuna, F.M., Nguyen, T.D.: Text-based content search and retrieval in ad hoc p2p communities. In: Gregori, E., Cherkasova, L., Cugola, G., Panzieri, F., Picco, G.P. (eds.) Web Engineering and Peer-to-Peer Computing. LNCS, vol. 2736, pp. 220–234. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci. 66(4), 614–656 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  12. Gao, J., Steenkiste, P.: Design and evaluation of a distributed scalable content discovery system. IEEE J. Sel. Areas Commun. 22, 54–66 (2004)

    Article  Google Scholar 

  13. Guo, D., Liu, Y., Li, X., Yang, P.: False negative problem of counting bloom filter. IEEE Trans. Knowl. Data Eng. 22(5), 651–664 (2010)

    Article  Google Scholar 

  14. Huang, S., Xue, G.-R., Zhu, X., Ge, Y.-F., Yu, Y.: DHT based searching improved by sliding window. In: Li, Q., Wang, G., Feng, L. (eds.) WAIM 2004. LNCS, vol. 3129, pp. 208–217. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  15. Jayalakshmi, G., Vijayalakshmi, M.: Effective multi keyword search over p2p network using optimized bloom filter settings. Int. J. Emerg. Technol. Adv. Eng. 3(1), 85–93 (2013). Special Issue

    Google Scholar 

  16. Kermarrec, A.-M., Triantafillou, P.: Xl peer-to-peer pub/sub systems. ACM Comput. Surv. 46(2), 16:1–16:45 (2013)

    Article  Google Scholar 

  17. Li, J., Loo, B.T., Hellerstein, J.M., Kaashoek, M.F., Karger, D.R., Morris, R.: On the feasibility of peer-to-peer web indexing and search. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 207–215. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  18. Luu, T., Klemm, F., Podnar, I., Rajman, M., Aberer, K.: Alvis peers: a scalable full-text peer-to-peer retrieval engine. In: Workshop on Information Retrieval in Peer-to-Peer Networks P2P-IR at CIKM 2006 (2006)

    Google Scholar 

  19. Podnar, I., Rajman, M., Luu, T., Klemm, F., Aberer, K.: Scalable peer-to-peer web retrieval with highly discriminative keys. In: Proceedings of the 23rd International Conference on Data Engineering, ICDE, Istanbul, Turkey, 15–20 April, pp. 1096–1105 (2007)

    Google Scholar 

  20. Rahmani, M., Benchaïba, M.: A comparative study of replication schemes for structured p2p networks. In: The Ninth International Conference on Internet and Web Applications and Services, ICIW 2014, pp. 147–158 (2014)

    Google Scholar 

  21. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: ACM SIGCOMM, August 2001

    Google Scholar 

  22. Skobeltsyn, G., Luu, T., Podnar Zarko, I., Rajman, M., Aberer, K.: Query-driven indexing for peer-to-peer text retrieval. In: 16th International World Wide Web Conference (WWW 2007). ACM, New York (2007)

    Google Scholar 

  23. Skobeltsyn, G., Luu, T., Podnar Zarko, I., Rajman, M., Aberer, K.: Query-driven indexing for scalable peer-to-peer text retrieval. Future Generat. Comput. Syst. 25, 89–99 (2009)

    Article  Google Scholar 

  24. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. In: ACM SIGCOMM, pp. 149–160 (2001)

    Google Scholar 

  25. Varga, A.: The omnet++ discrete event simulation system. In: European Simulation Multiconference (ESM 2001), hal-00250235, version 2, 25 February 2008, June 2001

    Google Scholar 

  26. Xia, F., Asabere, N.Y., Ahmed, A.M., Li, J., Kong, X.: Mobile multimedia recommendation in smart communities: a survey. IEEE access, CoRR abs/1312.6565 (2013)

    Google Scholar 

  27. Xie, K., Wen, J., Zhang, D., Xie, G.: Bloom filter query algorithm. J. Softw. 20(1), 96–108 (2009)

    Article  Google Scholar 

  28. Zhao, B., Huang, L., Stribling, J., Rhea, S., Kubiatowicz, J.: Tapestry: a global-scale overlay for rapid service deployment. IEEE J-SAC 22(1), 41–53 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ISIM Gabes, University of Gabes, Gabès, Tunisia

    Sonia Gaied Fantar

  2. Research Unit Prince, ISITC Hammam Sousse, University of Sousse, Sousse, Tunisia

    Habib Youssef

Authors
  1. Sonia Gaied Fantar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Habib Youssef
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sonia Gaied Fantar .

Editor information

Editors and Affiliations

  1. Université Paris Diderot, Paris Cedex 13, France

    Ahmed Bouajjani

  2. Université Paris Diderot, Paris Cedex 13, France

    Hugues Fauconnier

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Fantar, S.G., Youssef, H. (2015). Peer-to-Peer Full-Text Keyword Search of the Web. In: Bouajjani, A., Fauconnier, H. (eds) Networked Systems . NETYS 2015. Lecture Notes in Computer Science(), vol 9466. Springer, Cham. https://doi.org/10.1007/978-3-319-26850-7_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-26850-7_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-26849-1

  • Online ISBN: 978-3-319-26850-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation