vix.ing · top · new · best · stats · spec

Fedra: Query Processing for SPARQL Federations with Divergence

2014/07/10 by Gabriela Montoya, Montoya, Gabriela, Hala Skaf-Molli +7 · 1 citation
Biochemistry, Genetics and Molecular Biology · Computer Science · #Biomedical Text Mining and Ontologies #Databases (cs.DB) #FOS: Computer and information sciences #Genomics and Phylogenetic Studies #Semantic Web and Ontologies #cs.DB

paper · pdf · doi:10.48550/arxiv.1407.2899

arxiv created 2014/07/10 · openalex publication_date 2014/07/10 · arxiv updated 2014/07/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Data replication and deployment of local SPARQL endpoints improve scalability and availability of public SPARQL endpoints, making the consumption of Linked Data a reality. This solution requires synchronization and specific query processing strategies to take advantage of replication. However, existing replication aware techniques in federations of SPARQL endpoints do not consider data dynamicity. We propose Fedra, an approach for querying federations of endpoints that benefits from replication. Participants in Fedra federations can copy fragments of data from several datasets, and describe them using provenance and views. These descriptions enable Fedra to reduce the number of selected endpoints while satisfying user divergence requirements. Experiments on real-world datasets suggest savings of up to three orders of magnitude.

Cited by

Related