Algebraic Structures for Capturing the Provenance of SPARQL Queries

DOI10.1145/2810037zbMATH Open1426.68079OpenAlexW2274748974WikidataQ130905937 ScholiaQ130905937MaRDI QIDQ3177765FDOQ3177765

Vassilis Christophides, Thomas Unger, Grigoris Karvounarakis, Irini Fundulaki, Floris Geerts

Publication date: 2 August 2018

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01411827/file/a7-geerts.pdf

zbMATH Keywords

query languagesRDFSPARQLalgebraic structuresannotationsprovenance modelsspm-semirings

Mathematics Subject Classification ID

Database theory (68P15) Semirings (16Y60)

Cited In (5)

• Provenance analysis for logic and games
• Semirings of Evidence
• Why-provenance information for RDF, rules, and negation
• Complexity and expressive power of weakly well-designed SPARQL
• Provenance in databases: principles and applications

   Recommendations

• Relationalization of provenance data in complex RDF reification nodes 👍 👎
• On the satisfiability problem for SPARQL patterns 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Algebraic Structures for Capturing the Provenance of SPARQL Queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177765)