Foundations of Query Languages
02 May 2011 |
Introduction, Conjunctive Queries |
|
04 May 2011 |
Conjunctive Query Containment |
|
09 May 2011 |
Conjunctive Query Containment, Minimization |
|
11 May 2011 |
Exercise 1 |
|
16.May 2011 |
Hypergraphs |
|
18.May 2011 |
Treewidth of Graphs |
|
23.May 2011 |
SQL, First Oder Queries |
|
25 May 2011 |
Exercise 2 |
|
30.May 2011 |
First Order Queries, Complexity |
|
1.June 2011 |
First Order Queries, Complexity |
|
6.June 2011 |
First Order Queries, Complexity |
|
8 June 2011 |
Exercise 3 |
|
20.June 2011 |
First Order Queries, Undecidability |
|
22 June 2011 |
Exercise 4 |
|
27.June 2011 |
Datalog, Introduction |
|
29 June 2011 |
Exercise 5 |
|
4.July 2011 |
Datalog+, Evaluation and Semantics |
|
6.July 2011 |
Datalog+, fixpoint and minimal model |
|
11.July 2011 |
Datalog boundness, Stratified Datalog |
|
13 July 2011 |
Exercise 6 |
|
18.July 2011 |
Datalog well-founded Semantics |
|
20.July 2011 |
Datalog Complexity |
|
25.July 2011 |
Datalog Complexity |
|
27 July 2011 |
Exercise 7 |
|
Additional Research Papers
A Tourist Guide through Treewidth, Hans L. Bodlaender, Acta Cybernetica 1993 Vol. 11.