Semantics and Complexity of SPARQL [article]

Jorge Perez, Marcelo Arenas, Claudio Gutierrez
2006 arXiv   pre-print
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 a fragment without literals and a simple version of filters which encompasses all the main issues yet is simple to formalize. We provide a compositional semantics, prove there are normal forms, prove complexity bounds, among others that the evaluation of SPARQL patterns is PSPACE-complete,
more » ... mpare our semantics to an alternative operational semantics, give simple and natural conditions when both semantics coincide and discuss optimizations procedures.
arXiv:cs/0605124v1 fatcat:ww4sb6bzlfcoximbb4qx5p4bze