Tracking Federated Queries in the Linked Data

Abstract : Federated query engines allow data consumers to execute queries over the federation of Linked Data (LD). However, as feder-ated queries are decomposed into potentially thousands of subqueries distributed among SPARQL endpoints, data providers do not know fed-erated queries, they only know subqueries they process. Consequently, unlike warehousing approaches, LD data providers have no access to secondary data. In this paper, we propose FETA (FEderated query TrAcking), a query tracking algorithm that infers Basic Graph Patterns (BGPs) processed by a federation from a shared log maintained by data providers. Concurrent execution of thousand subqueries generated by multiple fed-erated query engines makes the query tracking process challenging and uncertain. Experiments with Anapsid show that FETA is able to extract BGPs which, even in a worst case scenario, contain BGPs of original queries.
Type de document :
[Research Report] LINA-University of Nantes. 2015
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger
Contributeur : Patricia Serrano Alvarado <>
Soumis le : jeudi 27 août 2015 - 09:28:46
Dernière modification le : vendredi 17 août 2018 - 14:34:02
Document(s) archivé(s) le : samedi 28 novembre 2015 - 10:22:36


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01187519, version 1



Georges Nassopoulos, Patricia Serrano-Alvarado, Pascal Molli, Emmanuel Desmontils. Tracking Federated Queries in the Linked Data. [Research Report] LINA-University of Nantes. 2015. 〈hal-01187519〉



Consultations de la notice


Téléchargements de fichiers