%0 Unpublished work %T Efficient Query Processing for SPARQL Federations with Replicated Fragments %+ Gestion de Données Distribuées [Nantes] (GDD) %+ Universidad Simón Boĺvar %A Montoya, Gabriela %A Skaf-Molli, Hala %A Molli, Pascal %A Vidal, Maria-Esther %Z AP %Z GDD_HCERES2020 %8 2015-01-20 %D 2015 %Z 1503.02940 %K SPARQL Federation %K Source Selection %K Replicated Fragments %Z Computer Science [cs]/Databases [cs.DB] %Z Computer Science [cs]/WebPreprints, Working Papers, ... %X 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. %G English %2 https://nantes-universite.hal.science/hal-01128834/document %2 https://nantes-universite.hal.science/hal-01128834/file/paper.pdf %L hal-01128834 %U https://nantes-universite.hal.science/hal-01128834 %~ UNIV-NANTES %~ CNRS %~ LINA %~ LINA-GDD %~ NANTES-UNIVERSITE %~ UNIV-NANTES-AV2022