Federated SPARQL Query Processing over Heterogeneous Linked Data Fragments

14Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Linked Data Fragments (LDFs) are Web interfaces that enable 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. So far, 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 propose an interface-aware framework and illustrate its applicability with a prototypical approach. The results over the FedBench benchmark show a substantial improvement in performance by devising this interface-aware approach that exploits the capabilities of heterogeneous interfaces in federations.

Cite

CITATION STYLE

APA

Heling, L., & Acosta, M. (2022). Federated SPARQL Query Processing over Heterogeneous Linked Data Fragments. In WWW 2022 - Proceedings of the ACM Web Conference 2022 (pp. 1047–1057). Association for Computing Machinery, Inc. https://doi.org/10.1145/3485447.3511947

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free