HELIN Federated Search Task Force Final Report

Final report of the HELIN Federated Search Task Force, a group appointed by the HELIN Reference Committee at the request of the HELIN Directors to investigate and report on available federated search engines, which allow users simultaneously to search multiple databases. The task force was not asked to recommend a specific one for licensing by HELIN member libraries and did not do so

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 federated queries are decomposed into potentially thousands of subqueries distributed among SPARQL endpoints, data providers do not know federated 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 federated 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