Paper detail

A Framework for Federated SPARQL Query Processing over Heterogeneous Linked Data Fragments

Linked Data Fragments (LDFs) refer to Web interfaces that allow for accessing and querying Knowledge Graphs on the Web. These interfaces, such as SPARQL endpoints or Triple Pattern Fragment servers, differ in the SPARQL expressions they can evaluate and the metadata they provide. Client-side query processing approaches have been proposed and are tailored to evaluate queries over individual interfaces. Moreover, federated query processing has focused on federations with a single type of LDF interface, typically SPARQL endpoints. In this work, we address the challenges of SPARQL query processing over federations with heterogeneous LDF interfaces. To this end, we formalize the concept of federations of Linked Data Fragment and propose a framework for federated querying over heterogeneous federations with different LDF interfaces. The framework comprises query decomposition, query planning, and physical operators adapted to the particularities of different LDF interfaces. Further, we propose an approach for each component of our framework and evaluate them in an experimental study on the well-known FedBench benchmark. The results show a substantial improvement in performance achieved by devising these interface-aware approaches exploiting the capabilities of heterogeneous interfaces in federations.