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.
Type de document :
Pré-publication, Document de travail
AP. 2015
Liste complète des métadonnées

http://hal.univ-nantes.fr/hal-01128834
Contributeur : Gabriela Montoya <>
Soumis le : mardi 10 mars 2015 - 14:33:38
Dernière modification le : jeudi 5 avril 2018 - 10:37:00
Document(s) archivé(s) le : lundi 17 avril 2017 - 06:34:38

Fichiers

paper.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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. AP. 2015. 〈hal-01128834〉

Partager

Métriques

Consultations de la notice

1031

Téléchargements de fichiers

177