Tracking Federated Queries in the Linked Data - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2015

Tracking Federated Queries in the Linked Data


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.
Fichier principal
Vignette du fichier
mainFETA.pdf (591.42 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01187519 , version 1 (27-08-2015)


  • 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⟩
209 View
68 Download


Gmail Facebook Twitter LinkedIn More