LaBeeB: Systematic Peer Clustering for Building a Semantic Peer-to-Peer Web Search Engine

  • Motasem Al Amour
Part of the Studies in Computational Intelligence book series (SCI, volume 391)


Search engines (SE) were only considered in presenting the results of a search query ranked according to a certain algorithm. This means all users will see the same results for the same query (at the same time). Although these users differ in many aspects, this fact was not considered in modern search engines. Peer-to- Peer SEs have tried to imitate centralized ones, with little success. They were faced with massive amount of data, very dynamic structure of the environment and a big number of peers. The real power of a p2p network was not utilized sufficiently, which is the peers themselves. Peers are a representation of human identities in the internet. A peer (or a human) can be categorized by the following criteria: the language it speaks, the country it comes from, the age group it belongs to and the human character it falls under. This very peer in turn has many interests, and so it will visit web pages that match these interests. This information for this peer and million others will be then saved in the p2p network. With proper interpretation of this information a semantic web search engine can be built and a systematic method can be used to rank the result of a query according to the number of visited web pages visited by peers that have the same criteria as the query initiator.

In this paper we present LaBeeB, an innovative p2p web search engine that can resolve user queries effectively in a semantic fashion and can then rank the results based on human factors.


Overlay Network Distribute Hash Table Inverted Index Super Peer Active Peer 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Stoica, I., Morris, R., Karger, D.R., Frans Kaashoek, M., Balakrishnan, H.: Chord: A Scalable PeertoPeer Lookup Service for Internet Applications. In: SIGCOMM (2001)Google Scholar
  2. 2.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: ACM SIGCOMM (August 2001)Google Scholar
  3. 3.
  4. 4.
    Terpstra, W.W., Leng, C., Buchmann, A.P.: BubbleStorm: Analysis of Probabilistic Exhaustive Search in a Heterogeneous Peer-to-Peer System. In: Technical Report, No. TUD-CS-2007-2, TU Darmstadt (May 2007)Google Scholar
  5. 5.
    Terpstra, W.W., Kangasharju, J., Leng, C., Buchmann, A.P.: BubbleStorm: Resilient, Probabilistic, and Exhaustive Peer-to-Peer Search. In: Proceedings of the 2007 ACM SIGCOMM Conference (2007)Google Scholar
  6. 6.
    Al Amour, M.: Design and prototypical development of a Chord-based Peer-to-Peer Network for a Distributed Virtual Community. Master Thesis, University Dusiburg-Essen (2008)Google Scholar
  7. 7.
    Tang, C., Xu, Z., Dwarkadas, S.: Peer-to-peer information retrieval using self-organizing semantic overlay networks. In: Proceedings of ACM SIGCOMM, pp. 175–186 (August 2003)Google Scholar
  8. 8.
    Li, M., Lee, W.C., Sivasubramaniam, A.: Semantic Small World: An Overlay Network for Peer-to-Peer Search. In: Proc. 12th IEEE International Conference on Network Protocols, ICNP 2004 (2004)Google Scholar
  9. 9.
    Wang, H., Zhu, Y., Hu, Y.: An Efficient and Secure Peer-to-Peer Overlay Network. University of Cincinnati (2005)Google Scholar
  10. 10.
  11. 11.
  12. 12.
  13. 13.
  14. 14.
    Sebastiani, F.: Text categorization. In: Zanasi, A. (ed.) Text Mining and its Applications, pp. 109–129. WIT Press, Southampton (2005)Google Scholar
  15. 15.
    Joachims, T.: Making large-Scale SVM Learning Practical. In: Schölkopf, B., Burges, C., Smola, A. (eds.) Advances in Kernel Methods - Support Vector Learning. MIT Press (1999)Google Scholar
  16. 16.
    Schapire, R.E., Singer, Y.: BOOSTEXTER: a boosting-based system for text categorization. Machine Learning 39(2/3), 135–168 (2000)CrossRefGoogle Scholar
  17. 17.
    Lampson, B.: Designing a global name service. In: Proc. 4th ACM Symposium on Principles of Distributed Computing, Minaki, Ontario, pp. 1–10 (1986)Google Scholar
  18. 18.
    Traversat, B., Abdelaziz, M., Pouyoul, E.: Project JXTA: A Loosely-Consistent DHT Rendezvous Walker. Project JXTA Sun Microsystems, Inc.Google Scholar
  19. 19.
    Häusel, H.-G.: Think limbic! Die Macht des Unbewussten verstehen und nutzen für Motivation. Marketing, Management, Haufe (2009)Google Scholar
  20. 20.
    Häusel, H.-G.: Brain View Warum Kunden kaufen, Haufe (2008)Google Scholar
  21. 21.
    Bender, M., Michel, S., Triantafillou, P., Weikum, G., Zimmer, C.: Minerva: Collaborative P2P Search. In: VLDB (2005)Google Scholar
  22. 22.
    Bender, M., Michel, S., Triantafillou, P., Weikum, G., Zimmer, C.: P2P Web Search with MINERVA: How do you want to search tomorrow?Google Scholar
  23. 23.
    Loo, B.T., Huebsch, R., Stoica, I., Hellerstein, J.M.: The Case for a Hybrid P2P Search Infrastructure. In: IPTS (2004)Google Scholar
  24. 24.
    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)Google Scholar
  25. 25.
    Podnar, I., Rajman, M., Luu, T., Klemm, F., Aberer, K.: Beyond Term Indexing: A P2P Framework for Web Information Retrieval. Informatica, Special Issue on Specialised Web Search (2006)Google Scholar
  26. 26.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Faculty of Mathematics and Computer Science Chair of CommunicationNetworks Fernuniversität HagenHagenGermany

Personalised recommendations