Content area
P2P systems allow users to share and access different resources over Internet. Actually, they are an excellent alternative to client/server ones, since they are fault tolerant and more scalable. Nonetheless, searching pertinent peers (i.e., peers which share pertinent resources) to user queries in large scale P2P systems is a major problem. In the literature, this task is commonly named query routing. In this respect, the author introduces in this paper a new query-based routing method for unstructured P2P systems. The main originality of our method is the exploitation of the strong connections between query terms and relevant peers, which provided pertinent results for those queries, to define a user profile model. Thus, the computation of the user profile comes down to extracting special types of triadic formal concepts. The user profile is used latter to efficiently route the forthcoming queries. Simulation results show that our method is more effective than the baseline method.
Details
1 Department of Information Systems and Technology, College of Computer Science and Engineering, University of Jeddah, Saudi Arabia