The Expressive Power of SPARQL

@inproceedings{Angles2008TheEP,
  title={The Expressive Power of SPARQL},
  author={Renzo Angles and C. Guti{\'e}rrez},
  booktitle={International Semantic Web Conference},
  year={2008}
}
This paper studies the expressive power of SPARQL. The main result is that SPARQL and non-recursive safe Datalog with negation have equivalent expressive power, and hence, by classical results, SPARQL is equivalent from an expressiveness point of view to Relational Algebra. We present explicit generic rules of the transformations in both directions. Among other findings of the paper are the proof that negation can be simulated in SPARQL, that non-safe filters are superfluous, and that current… Expand
Negation in SPARQL
On the primitivity of operators in SPARQL
The Multiset Semantics of SPARQL Patterns
Semantics and complexity of SPARQL
Semantics and Expressive Power of Subqueries and Aggregates in SPARQL 1.1
The Problem of Correlation and Substitution in SPARQL - Extended Version
Containment and equivalence of well-designed SPARQL
On Expressibility of Non-Monotone Operators in SPARQL
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 16 REFERENCES
Semantics and Complexity of SPARQL
Semantics and complexity of SPARQL
A SPARQL Semantics Based on Datalog
From SPARQL to rules (and back)
A relational algebra for SPARQL
RDF Querying: Language Constructs and Evaluation Methods Compared
Foundations of Databases
A Guided Tour of Relational Databases and Beyond
...
1
2
...