Semantics and Complexity of SPARQL

From semanticweb.org

Jump to: navigation, search

domzel A paper written by Marcelo Arenas, Jorge Perez and Claudio Gutierrez. It was presented at the ISWC2006.

This paper won the Best Research Paper award at ISWC2006.

[edit] 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.

The schedule for this talk can be found in the conference programme and a linked list of all talks is provided in the article on ISWC2006 papers. This article has originally been created from the RDF metadata for ISWC 2006.

Retrieved from "http://semanticweb.org/wiki/Semantics_and_Complexity_of_SPARQL"
Personal tools