首页> 外文OA文献 >Efficient Query Processing for SPARQL Federations with Replicated Fragments
【2h】

Efficient Query Processing for SPARQL Federations with Replicated Fragments

机译:具有复制片段的spaRQL联合的高效查询处理

摘要

Low reliability and availability of public SPARQL endpoints prevent real-world applications from exploiting all the potential of these querying infras-tructures. Fragmenting data on servers can improve data availability but degrades performance. Replicating fragments can offer new tradeoff between performance and availability. We propose FEDRA, a framework for querying Linked Data that takes advantage of client-side data replication, and performs a source selection algorithm that aims to reduce the number of selected public SPARQL endpoints, execution time, and intermediate results. FEDRA has been implemented on the state-of-the-art query engines ANAPSID and FedX, and empirically evaluated on a variety of real-world datasets.
机译:公共SPARQL端点的低可靠性和可用性阻止了实际应用程序利用这些查询基础结构的所有潜力。在服务器上对数据进行分段可以提高数据可用性,但会降低性能。复制片段可以在性能和可用性之间提供新的权衡。我们提出FEDRA,这是一种利用客户端数据复制来查询链接数据的框架,并执行一种源选择算法,该算法旨在减少所选公共SPARQL端点的数量,执行时间和中间结果。 FEDRA已在最先进的查询引擎ANAPSID和FedX上实现,并在各种现实数据集中进行了经验评估。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号