Algebraic Structures for Capturing the Provenance of SPARQL Queries

DOI10.1145/2810037MaRDI QIDQ3177765zbMATH OpenOpenAlexWikidataFDO

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

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

algebraic structuresannotationsprovenance modelsquery languagesRDFSPARQLspm-semirings

Mathematics Subject Classification ID

Semirings (16Y60) Database theory (68P15)

Recommendations

• Relationalization of provenance data in complex RDF reification nodes
• On the satisfiability problem for SPARQL patterns
• scientific article; zbMATH DE number 7456050

Cited in

(8)

• Complexity and expressive power of weakly well-designed SPARQL
• Provenance analysis for logic and games
• Why-provenance information for RDF, rules, and negation
• Semirings of Evidence
• Provenance in databases: principles and applications
• Semiring provenance for fixed-point logic
• Provenance analysis and semiring semantics for first-order logic
• Rule and constraint based debugging of DBpedia queries

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)