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 metadatas

http://hal.univ-nantes.fr/hal-01128834
Contributor : Gabriela Montoya <>
Submitted on : Tuesday, March 10, 2015 - 2:33:38 PM
Last modification on : Monday, July 16, 2018 - 11:24:04 AM
Long-term archiving on : Monday, April 17, 2017 - 6:34:38 AM

Files

paper.pdf
Files produced by the author(s)

Identifiers

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

Collections

Citation

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

Share

Metrics

Record views

1634

Files downloads

181