Semantics and Complexity of SPARQL
Jorge Perez, Marcelo Arenas, Claudio Gutierrez
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.
Create a lesson
Related papers
Compositional Online Learning for Semantic Data Processing Systems
Paweł Liskowski, Fuheng Zhao, Benjamin Han et al.
Incremental Delta-Shapley: A Standalone Runtime for Predicate Attribution on Sliding Windows
Pouya Khani, Ira Assent
Size Bounds for CQs Under Acyclic Constraints
Stefan Mengel, Andrei Romashchenko
IBLTs Measure Before They Decode: Self-Sizing Set Reconciliation from Pre-Peeling Counts
Min Wu, Ji Qi, Chengdui Luo et al.
VoS: Variate Ordering Strategies for Skyline Query Optimization
Abhinav Gorantla, Pratanu Mandal, K. Selçuk Candan et al.
Realistic Counterfactual Explanations via Denial Constraints
Avia Asael, Nave Frost, Amir Gilad et al.