Semantics and Complexity of SPARQL

@inproceedings{Prez2006SemanticsAC,
  title={Semantics and Complexity of SPARQL},
  author={Jorge P{\'e}rez and M. Arenas and C. Guti{\'e}rrez},
  booktitle={International Semantic Web Conference},
  year={2006}
}
SPARQL is the W3C candidate recommendation query language for RDF. In this paper we address systematically the formal study of SPARQL, concentrating in its graph pattern facility. We consider for this study simple RDF graphs without special semantics for literals and a simplified version of filters which encompasses all the main issues. We provide a compositional semantics, prove there are normal forms, prove complexity bounds, among others that the evaluation of SPARQL patterns is PSPACE… Expand

Paper Mentions

Blog Post
Semantics and complexity of SPARQL
SPARQL beyond Subgraph Matching
On Expressibility of Non-Monotone Operators in SPARQL
The Expressive Power of SPARQL
An Extension of SPARQL for RDFS
Semantics and Optimization of the SPARQL 1.1 Federation Extension
Towards Reconciling SPARQL and Certain Answers
nSPARQL : A Navigational Language for RDF 1
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 10 REFERENCES
Containment and Minimization of RDF/S Query Patterns
A Comparison of RDF Query Languages
RAL: An Algebra for Querying RDF