Semantic content search in P2P networks based on RDF schema

Efficiency in searching and data retrieval is a key issue in peer-to-peer networks. In this work we provide a detailed analysis of semantic routing and propose a new approach based on this technique and on resource description framework (RDF) to achieve better retrieval performance. The description, by employing metadata, of features of resources and their inter-relationships leads in fact to a higher accuracy in the outcome of the search applications providing appreciable benefits. The main idea standing behind semantic routing is to use the content of queries to drive routing decisions. Key elements of such technique are: node learning process definition, routing table (called knowledge-base) structure design, node goodness computation and selection of the best candidates for query routing. An exhaustive description of these fundamental issues is provided in this work.