2006 | OriginalPaper | Buchkapitel
Semantic Query Routing in Unstructured Networks Using Social Metaphors
verfasst von : Christoph Tempich, Steffen Staab
Erschienen in: Semantic Web and Peer-to-Peer
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In Peer-to-Peer networks, finding the appropriate answer for an information request, such as the answer to a query for RDF(S) data, depends on selecting the right peer in the network. We here investigate how social metaphors can be exploited effectively and efficiently to solve this task. To this end, we define a method for query routing, REMINDIN’, that lets
(i)
peers observe which queries are successfully answered by other peers,
(ii)
memorizes this observation, and,
(iii)
subsequently uses this information in order to select peers to forward requests to.
REMINDIN’ has been implemented for the SWAP Peer-to-Peer platform as well as for a simulation environment. We have used the simulation environment in order to investigate how successful variations of REMINDIN’ are and how they compare to baseline strategies in terms of number of messages forwarded in the network and statements appropriately retrieved.