首页> 外文会议>International World Wide Web Conference >REMINDIN': Semantic Query Routing in Peer-to-Peer Networks Based on Social Metaphors
【24h】

REMINDIN': Semantic Query Routing in Peer-to-Peer Networks Based on Social Metaphors

机译:REMINDIN':基于社交隐喻的对等网络中的语义查询路由

获取原文

摘要

In peer-to-peer networks, onnding 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 efon- ciently to solve this task. To this end, we deonne a method for query routing, REMINDIN', that lets (ⅰ) peers observe which queries are successfully answered by other peers, (ⅱ) memorizes this observation, and, (ⅲ) 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.
机译:在对等网络中,为信息请求提供适当答案(例如对RDF(S)数据查询的答案)取决于选择网络中的正确对等方。我们在这里研究如何有效,有效地利用社会隐喻来解决这一任务。为此,我们定义了一种查询路由方法REMINDIN',该方法使(ⅰ)个对等点观察哪些查询已被其他对等点成功回答,(ⅱ)记录了这一观察,并且(ⅲ)随后使用此信息来选择要转发请求的对等体。 REMINDIN'已在SWAP对等平台和模拟环境中实现。我们使用了模拟环境,以研究REMINDIN'的成功变体以及它们如何与网络中转发的消息数量和适当检索的语句相比,与基准策略进行比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号