Semantics and Complexity of SPARQL

Abstract

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, compare our semantics to an alternative operational semantics, give simple and natural conditions when both semantics coincide and discuss optimizations procedures.

Cited by in corpus (7)

• Storing and Analyzing Historical Graph Data at Scale
• Foundations of SPARQL Query Optimization
• Killing Two Birds with One Stone -- Querying Property Graphs using SPARQL via GREMLINATOR
• Towards an Integrated Graph Algebra for Graph Pattern Matching with Gremlin (Extended Version)
• Loop Patterns: Extension of Kleene Star Operator for More Expressive Pattern Matching against Arbitrary Data Structures
• A Flexible Framework for Defining, Representing and Detecting Changes on the Data Web
• Q-Graph: Preserving Query Locality in Multi-Query Graph Processing