Skip to Main content Skip to Navigation

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.
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download
Contributor : Patricia Serrano Alvarado <>
Submitted on : Thursday, August 27, 2015 - 9:28:46 AM
Last modification on : Tuesday, January 14, 2020 - 2:38:17 PM
Document(s) archivé(s) le : Saturday, November 28, 2015 - 10:22:36 AM


Files produced by the author(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⟩



Record views


Files downloads