Computing How-provenance for SPARQL queries via Query Rewriting - Archive ouverte HAL Access content directly
Journal Articles Proceedings of the VLDB Endowment (PVLDB) Year : 2021

Computing How-provenance for SPARQL queries via Query Rewriting

(1) , (2) , (2)
1
2

Abstract

Over the past few years, we have witnessed the emergence of large knowledge graphs built by extracting and combining information from multiple sources. This has propelled many advances in query processing over knowledge graphs, however the aspect of providing provenance explanations for query results has so far been mostly neglected. We therefore propose a novel method, SPARQLprov, based on query rewriting, to compute how-provenance polynomials for SPARQL queries over knowledge graphs. Contrary to existing works, SPARQLprov is system-agnostic and can be applied to standard and already deployed SPARQL engines without the need of customized extensions. We rely on spm-semirings to compute polynomial annotations that respect the property of commutation with homomorphisms on monotonic and non-monotonic SPARQL queries without aggregate functions. Our evaluation on real and synthetic data shows that SPARQLprov over standard engines incurs an acceptable runtime overhead w.r.t. the original query, competing with state-of-the-art solutions for how-provenance computation.
Not file

Dates and versions

hal-03500656 , version 1 (22-12-2021)

Identifiers

Cite

Luis Galárraga, Daniel Hernández, Katja Hose. Computing How-provenance for SPARQL queries via Query Rewriting. Proceedings of the VLDB Endowment (PVLDB), 2021, 14 (13), pp.3389-3401. ⟨10.14778/3484224.3484235⟩. ⟨hal-03500656⟩
28 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More