The Expressive Power of SPARQL

author:Renzo Angles, University of Chile
published: Nov. 24, 2008, recorded: October 2008, views: 197

You might be experiencing some problems with Your Video player.

Slides

Slides
0:00	The Expressive power of SPARQL
0:26	Motivations (1)
0:41	Motivations (2)
0:53	Motivations (3)
1:01	Motivations (4)
1:12	Outline (1)
1:21	Outline (2)
1:32	Outline (3)
1:49	Outline (4)
2:02	Expressive power of SPARQL: Tour (1)
2:20	Expressive power of SPARQL: Tour (2)
2:24	Expressive power of SPARQL: Tour (3)
2:26	Expressive power of SPARQL: Tour (4)
2:27	Expressive power of SPARQL: Tour (5)
2:31	Expressive power of SPARQL: Tour (6)
2:39	Expressive power of SPARQL: Tour (7)
2:43	Expressive power of SPARQL: Tour (8)
2:50	Expressive power of SPARQL: Tour (9)
2:54	Expressive power of SPARQL: Tour (10)
3:01	Expressive power of SPARQL: Tour (11)
3:03	SPARQL Query (General structure)
3:47	Syntax of SPARQL graph patterns (1)
4:02	Syntax of SPARQL graph patterns (2)
4:08	Syntax of SPARQL graph patterns (3)
4:12	Syntax of SPARQL graph patterns (4)
4:13	Syntax of SPARQL graph patterns (5)
4:16	Syntax of SPARQL graph patterns (6)
4:33	Example of SPARQL query (SELECT) (1)
4:35	Example of SPARQL query (SELECT) (2)
4:37	Example of SPARQL query (Triple pattern)
4:50	Example of SPARQL query (AND)
5:06	Example of SPARQL query (FILTER)
5:14	Example of SPARQL query (OPTIONAL)
5:24	Example of SPARQL query (UNION)
5:33	W3C Semantics of SPARQL (1)
5:48	W3C Semantics of SPARQL (2)
5:51	W3C Semantics of SPARQL (3)
6:10	W3C Semantics of SPARQL (4)
6:16	W3C Semantics of SPARQL (5)
6:31	Expressive power of SPARQL: Tour
6:44	Notion of Expressive Power (1)
7:11	Notion of Expressive Power (2)
7:21	Notion of Expressive Power (3)
7:38	SPARQL-S: Accepting only Safe Patterns (1)
8:03	SPARQL-S: Accepting only Safe Patterns (2)
8:20	SPARQL-S: Accepting only Safe Patterns (3)
8:30	SPARQL-S: Accepting only Safe Patterns (4)
8:41	SPARQL-S: Accepting only Safe Patterns (5)
9:12	SPARQL-S: Accepting only Safe Patterns (6)
9:24	SPARQL-S: Accepting only Safe Patterns (7)
9:32	SPARQL-S: Accepting only Safe Patterns (8)
9:35	SPARQL-S: Accepting only Safe Patterns (9)
9:39	SPARQL-S: Accepting only Safe Patterns (10)
9:58	SPARQL-S: Schema of translation from SPARQL (1)
10:11	SPARQL-S: Schema of translation from SPARQL (2)
10:18	SPARQL-S: Schema of translation from SPARQL (3)
10:51	SPARQL-S: Schema of translation from SPARQL (4)
11:18	Expressive power of SPARQL: Tour
11:24	SPARQL-C: SPARQL with compositionla semantics (1)
11:30	SPARQL-C: SPARQL with compositional semantics (2)
11:36	SPARQL-C: SPARQL with compositional semantics (3)
11:39	SPARQL-C: SPARQL with compositional semantics (4)
11:48	SPARQL-C Semantics Overview: Building blocks (1)
12:15	SPARQL-C Semantics Overview: Building blocks (2)
12:35	SPARQL-C Semantics Overview: Building blocks (3)
12:41	SPARQL-C Semantics Overview: Operations (1)
12:59	SPARQL-C Semantics Overview: Operations (2)
13:08	SPARQL-C Semantics Overview: FILTERs (1)
13:22	SPARQL-S is equivalent to SPARQL-C (1)
13:31	SPARQL-S is equivalent to SPARQL-C (2)
13:54	SPARQL-S is equivalent to SPARQL-C (3)
14:02	Expressive power of SPARQL: Tour
14:10	SPARQL-C to Datalog (1)
15:03	SPARQL-C to Datalog (2)
15:09	SPARQL-C to Datalog (3)
15:23	SPARQL-C to Datalog (4)
15:25	SPARQL-C to Datalog (5)
15:49	Datalog to SPARQL-C (1)
16:38	Datalog to SPARQL-C (2)
17:22	Datalog to SPARQL-C (3)
17:30	Datalog to SPARQL-C (4)
17:40	Datalog to SPARQL-C (5)
17:42	Datalog to SPARQL-C (6)
17:50	Datalog to SPARQL-C (7)
18:04	Conclusions (1)
18:18	Conclusions (2)
18:50	Conclusions (3)
19:08	Questions?

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.

Lecture popularity: You need to login to cast your vote.

Description

This paper studies the expressive power of SPARQL. The main result is that SPARQL and non-recursive safe Datalog with negation have equivalent expressive power, and hence, by classical results, SPARQL is equivalent from an expressive point of view to Relational Algebra. We present explicit generic rules of the transformations in both directions. Among other findings of the paper are the proof that negation can be simulated in SPARQL, that non-safe filters are superfluous, and that current SPARQL W3C semantics can be simplified to a standard compositional one.