Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Efficient Query Processing for SPARQL Federations with Replicated Fragments

Abstract : 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata
Contributor : Gabriela Montoya Connect in order to contact the contributor
Submitted on : Tuesday, March 10, 2015 - 2:33:38 PM
Last modification on : Thursday, May 12, 2022 - 9:56:36 AM
Long-term archiving on: : Monday, April 17, 2017 - 6:34:38 AM


Files produced by the author(s)


  • HAL Id : hal-01128834, version 1
  • ARXIV : 1503.02940


Gabriela Montoya, Hala Skaf-Molli, Pascal Molli, Maria-Esther Vidal. Efficient Query Processing for SPARQL Federations with Replicated Fragments. 2015. ⟨hal-01128834⟩



Record views


Files downloads