Semantics and Complexity of SPARQL
introducer: Natasha Noy,
Stanford Center for Biomedical Informatics Research
author: Jorge Pérez, Pontificia Universidad Católica de Chile
published: Nov. 10, 2016, recorded: October 2016, views: 1687
author: Jorge Pérez, Pontificia Universidad Católica de Chile
published: Nov. 10, 2016, recorded: October 2016, views: 1687
Slides
Related content
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Description
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.
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !
Write your own review or comment: