Multiset semantics in SPARQL, Relational Algebra and Datalog
Renzo Angles, Claudio Gutierrez, Daniel Hern\'andez
TL;DR
This paper explores the algebraic and logical foundations of multiset semantics in SPARQL, aligning it with Datalog and Relational Algebra to establish their expressive equivalence.
Contribution
It characterizes the multiset semantics of SPARQL patterns and proves their equivalence with non-recursive Datalog and multiset relational algebra.
Findings
SPARQL multiset semantics are expressively equivalent to Datalog and relational algebra.
The study extends Datalog with safe negation to support multisets.
A multiset relational algebra is defined with specific operators.
Abstract
The paper analyzes and characterizes the algebraic and logical structure of the multiset semantics for SPARQL patterns involving AND, UNION, FILTER, EXCEPT, and SELECT. To do this, we align SPARQL with two well-established query languages: Datalog and Relational Algebra. Specifically, we study (i) a version of non-recursive Datalog with safe negation extended to support multisets, and (ii) a multiset relational algebra comprising projection, selection, natural join, arithmetic union, and except. We prove that these three formalisms are expressively equivalent under multiset semantics.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.