ISWC 2006 5th International Semantic Web Conference
Home General Information Program Call For Submissions Workshop/Tutorials Registration
general
Semantics and Complexity of SPARQL
Marcelo Arenas Pontificia Universidad Católica de Chile
Jorge A. Perez Universidad de Talca
Claudio Gutierrez Universidad de Chile

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.

Citation

5th International Semantic Web Conference, Athens, GA, USA, November 5-9, 2006, LNCS 4273

Organizer

LSDIS

Sponsors

Gold Sponsors

Silver Sponsors

Doctoral Consortium Sponsors

View All Sponsors

 

Footer Website Contact University of Georgia Franklin College of Arts and Sciences Computer Science Department