Efficient Query Processing for SPARQL Federations with Replicated Fragments - Nantes Université Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2015

Efficient Query Processing for SPARQL Federations with Replicated Fragments

Gabriela Montoya
Pascal Molli
Maria-Esther Vidal
  • Fonction : Auteur
  • PersonId : 938811

Résumé

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.
Fichier principal
Vignette du fichier
paper.pdf (285.95 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01128834 , version 1 (10-03-2015)

Identifiants

Citer

Gabriela Montoya, Hala Skaf-Molli, Pascal Molli, Maria-Esther Vidal. Efficient Query Processing for SPARQL Federations with Replicated Fragments. 2015. ⟨hal-01128834⟩
222 Consultations
101 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More