Fedra: Query Processing for SPARQL Federations with Divergence
Gabriela Montoya (LINA), Hala Skaf-Molli (LINA), Pascal Molli (LINA),, Maria-Esther Vidal

TL;DR
Fedra is a novel approach for querying federations of SPARQL endpoints that leverages data replication and divergence-aware strategies to optimize query processing and reduce endpoint selection, significantly improving efficiency.
Contribution
Fedra introduces a divergence-aware query processing method for SPARQL federations that utilizes data replication and provenance to minimize endpoint usage.
Findings
Up to three orders of magnitude savings in query processing.
Effective reduction in the number of selected endpoints.
Improved handling of data dynamicity in federated SPARQL queries.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSemantic Web and Ontologies · Biomedical Text Mining and Ontologies · Genomics and Phylogenetic Studies
