The Expressive Power of SPARQL

@inproceedings{Angles2008TheEP,
  title={The Expressive Power of SPARQL},
  author={Renzo Angles and Claudio Guti{\'e}rrez},
  booktitle={SEMWEB},
  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… 
Negation in SPARQL
TLDR
A core SParQL algebra is identified which could be used instead of the W3C SPARQL algebra and the negation operators are analyzed in terms of their compliance with elementary axioms of set theory.
On the primitivity of operators in SPARQL
Semantics and complexity of SPARQL
TLDR
This article identifies a large class of SPARQL patterns, defined by imposing a simple and natural syntactic restriction, where the query evaluation problem can be solved more efficiently and shows that the evaluation problem is coNP-complete for well-designed patterns.
The Multiset Semantics of SPARQL Patterns
TLDR
It is proved that the fragment formed by AND, UNION, OPTIONAL, FILTER, MINUS and SELECT corresponds precisely to both, the intuitive multiset relational algebra (projection, selection, natural join, arithmetic union and except), and the mult iset non-recursive Datalog with safe negation.
Semantics and Expressive Power of Subqueries and Aggregates in SPARQL 1.1
TLDR
An in-depth formal analysis of the semantics and expressive power of these new constructs as defined in the SPARQL 1.1 specification are provided, and hence lay the necessary foundations for the development of robust, scalable and extensible query engines supporting complex numerical and analytics tasks.
The Problem of Correlation and Substitution in SPARQL - Extended Version
TLDR
This paper presents a formal framework to study why different implementations of SPARQL behave differently when evaluating queries with correlated variables based on Datalog, and shows that at the core of this problem lies the historically troubling notion of logical substitution.
Containment and equivalence of well-designed SPARQL
TLDR
A comprehensive complexity analysis of containment and equivalence for several fragments of SPARQL for basic extensions in the form of the UNION operator and/or projection results range from NP-completeness to undecidability.
On Expressibility of Non-Monotone Operators in SPARQL
TLDR
This work addresses the problem of expressibility of the full ternary OPTIONAL via the simplified binary version and shows that it is possible, but only with an exponential blowup in the size of the query (under common complexity-theoretic assumptions).
On the Satisfiability Problem of Patterns in SPARQL 1.1
TLDR
This paper provides a complete analysis of decidability/undecidability of satisfiability problems for SParQL 1.1 patterns and provides a guideline for future SPARQL query language design and implementation.
Foundations of SPARQL query optimization
TLDR
While studied in the context of a theoretically motivated set semantics, almost all results carry over to the official, bag-based semantics and therefore are of immediate practical relevance.
...
...

References

SHOWING 1-10 OF 16 REFERENCES
Semantics and complexity of SPARQL
TLDR
This article identifies a large class of SPARQL patterns, defined by imposing a simple and natural syntactic restriction, where the query evaluation problem can be solved more efficiently and shows that the evaluation problem is coNP-complete for well-designed patterns.
A SPARQL Semantics Based on Datalog
TLDR
This paper proposes a formal semantics for SPARQL based on datalog and proposes two useful extensions to SParQL, namely binding of variables to results of filter expressions and views on RDF graphs as datasets for queries.
A relational algebra for SPARQL
TLDR
A transformation from SPARQL queries into the relational algebra, an intermediate language for the expression and analysis of queries that is widely used in the database area is described.
RDF Querying: Language Constructs and Evaluation Methods Compared
TLDR
This article is an introduction into query languages for the Semantic Web, and an in-depth comparison of the languages introduced, with a focus on few, but representative languages a necessary condition for a non-trivial comparison.
Foundations of Databases
TLDR
This book discusses Languages, Computability, and Complexity, and the Relational Model, which aims to clarify the role of Semantic Data Models in the development of Query Language Design.
The Semantic Web - ISWC 2006, 5th International Semantic Web Conference, ISWC 2006, Athens, GA, USA, November 5-9, 2006, Proceedings
Research Track.- Ranking Ontologies with AKTiveRank.- Three Semantics for Distributed Systems and Their Relations with Alignment Composition.- Semantics and Complexity of SPARQL.- Ontology-Driven
KI 2007: Advances in Artificial Intelligence, 30th Annual German Conference on AI, KI 2007, Osnabrück, Germany, September 10-13, 2007, Proceedings
TLDR
Divergence versus Convergence of Intelligent Systems: Contrasting Artificial Intelligence with Cognitive Psychology, as well as other topics, are discussed.
A Guided Tour of Relational Databases and Beyond
TLDR
This is a guided tour of relational databases and beyond 1st edition and this book is referred to read because it is an inspiring book to give you more chance to get experiences and also thoughts.
SPARQL Query Language for RDF. http://www.w3.org/TR/2008/REC-rdf-sparql-query-20080115
  • 2008
Semantics andComplexity of SPARQL
  • In:Cruz, I., Decker, S., Allemang, D., Preist, C., Schwabe, D., Mika, P., Uschold, M., Aroyo, L.M. (eds.) ISWC 2006. LNCS, vol. 4273, pp. 30–43. Springer, Heidelberg
  • 2006
...
...