Semantics and Complexity of SPARQL

  • Jorge Pérez
  • Marcelo Arenas
  • Claudio Gutierrez
Conference paper

DOI: 10.1007/11926078_3

Volume 4273 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Pérez J., Arenas M., Gutierrez C. (2006) Semantics and Complexity of SPARQL. In: Cruz I. et al. (eds) The Semantic Web - ISWC 2006. ISWC 2006. Lecture Notes in Computer Science, vol 4273. Springer, Berlin, Heidelberg

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

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jorge Pérez
    • 1
  • Marcelo Arenas
    • 2
  • Claudio Gutierrez
    • 3
  1. 1.Universidad de TalcaChile
  2. 2.Pontificia Universidad Católica de ChileChile
  3. 3.Universidad de ChileChile