2015 | OriginalPaper | Chapter
Federated SPARQL Queries Processing with Replicated Fragments
Authors : Gabriela Montoya, Hala Skaf-Molli, Pascal Molli, Maria-Esther Vidal
Published in: The Semantic Web - ISWC 2015
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Federated query engines provide a unified query interface to federations of SPARQL endpoints. Replicating data fragments from different Linked Data sources facilitates data re-organization to better fit federated query processing needs of data consumers. However, existing federated query engines are not designed to support replication and replicated data can negatively impact their performance. In this paper, we formulate the source selection problem with fragment replication (SSP-FR). For a given set of endpoints with replicated fragments and a SPARQL query, the problem is to select the endpoints that minimize the number of tuples to be transferred. We devise the
Fedra
source selection algorithm that approximates SSP-FR. We implement
Fedra
in the state-of-the-art federated query engines FedX and ANAPSID, and empirically evaluate their performance. Experimental results suggest that
Fedra
efficiently solves SSP-FR, reducing the number of selected SPARQL endpoints as well as the size of query intermediate results.