Database Theory

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Database Theory

Lehrveranstaltung mit SWS 2/2/0 (Vorlesung/Übung/Praktikum) in SS 2016

Dozent

Tutor

Umfang (SWS)

  • 2/2/0

Module

Leistungskontrolle

  • Mündliche Prüfung

Databases are a key technology in computer science that brings together fascinating theoretical topics and highly relevant practical applications. The goal of this lecture is to give an extended introduction to this interesting field, with a special focus on database query languages, their expressive power, and computational complexity. The lecture will introduce the relational datamodel, and then discuss theoretical and practical aspects of a variety of query languages:

  • first-order logic as a query language and the relational algebra
  • conjunctive queries and their unions
  • navigational queries: path queries
  • Datalog and its relatives


The lecture focuses on core principles that apply to many types of databases alike (relational, graph-based, semantic web). Some important query answering algorithms are presented, too, but otherwise the details of database implementation and administration are not covered.

Prerequisites

An undergraduate-level knowledge of predicate logic, regular languages, and algorithmic and computational complexity is required. The lecture will connect with other topics in the Computer Science and Computational Logic curriculum, such as relational databases, logic programming, and Semantic Web technologies – familiarity with these topics is not required to follow the lecture.

Time plan

The general time plan is as follows:

  • Lectures: each Thursday in DS4 (13:00–14:30)
  • Exercises: each Monday in DS3 (11:10–12:40)

However, there will be some exceptions that will be announced in the lecture:

  • The first lecture is on Monday, 04 April 2016.
  • The lecture on Thursday, 9 June, will be in DS3 (from 11:10) in room APB 3027, since the afternoon is reserved for OUTPUT.DD 2016.
  • The lecture on Thursday, 16 June, will be held by Sebastian Rudolph.
  • The exercise session on Monday, 4 July, will be held by Tomáš Masopust.

Legacy

This course has first been taught at TU Dresden in the form of the 2015 lecture Foundations of Databases and Query Languages. The plan for this year's course will be very similar.

The structure of some of the lectures of this course is inspired by the course Theory of Data and Knowledge Bases in the version given by Georg Gottlob and Thomas Lukasiewicz at the University of Oxford.

The main reference textbook for the lecture is:

  • Serge Abiteboul, Richard Hull, Victor Vianu: Foundations of Databases. Addison-Wesley. 1994.
The book is available for free from its webpage, but there are also copies in the library.

Further texts might be consulted for background information and additional details:

  • Michael Sipser: Introduction to the Theory of Computation. 2005
Accessible introduction to complexity theory that covers all topics of computational complexity that the lecture touches upon.
  • Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov: Complexity and expressive power of logic programming. ACM Computing Surveys, 33:3, pp 374-425, 2001.
Covers all Datalog complexity results mentioned in the lecture. Available at http://dx.doi.org/10.1145/502807.502810 (may require access from within a university network)
  • additional references will be added in the course of the lecture

Veranstaltungskalender abonnieren (icalendar)

Vorlesung Introduction/Relational Data Model DS3, 4. April 2016 in APB E005 Download Download
Vorlesung First-Order Queries DS4, 7. April 2016 in APB E005 Download Download
Übung Relational Algebra DS3, 11. April 2016 in APB E005 Download
Vorlesung Query Answering Complexity DS4, 14. April 2016 in APB E005 Download Download
Übung First-Order Queries DS3, 18. April 2016 in APB E005 Download
Vorlesung FO Query Answering Complexity DS4, 21. April 2016 in APB E005 Download Download
Übung FO Query Answering Complexity DS3, 25. April 2016 in APB E005 Download
Vorlesung Conjunctive Queries DS4, 28. April 2016 in APB E005 Download Download
Übung Conjunctive Queries, CSP, and Hypergraphs DS3, 2. Mai 2016 in APB E005 Download
Übung Conjunctive Queries, CSP, and Hypergraphs DS3, 9. Mai 2016 in APB E005 Download
Vorlesung Tree-Like Conjunctive Queries DS4, 12. Mai 2016 in APB E005 Download Download
Übung Treewidth and Hypertree Width DS3, 23. Mai 2016 in APB E005 Download
Vorlesung Query Optimisation DS4, 26. Mai 2016 in APB E005 Download Download
Übung FO Query Optimisation and Trakhenbrot's Theorem DS3, 30. Mai 2016 in APB E005 Download
Vorlesung CQ Optimisation and FO Expressivity DS4, 2. Juni 2016 in APB E005 Download Download
Übung CQ Optimisation and FO Expressivity DS3, 6. Juni 2016 in APB E005 Download
Vorlesung FO Expressivity and Introduction to Datalog DS3, 9. Juni 2016 in APB 3027 Download Download
Übung FO Expressivity and Introduction to Datalog DS3, 13. Juni 2016 in APB E005 Download
Vorlesung Expressive Power and Complexity of Datalog DS4, 16. Juni 2016 in APB E005 Download Download
Übung Datalog DS3, 20. Juni 2016 in APB E005 Download
Vorlesung Datalog Optimisation and Evaluation DS4, 23. Juni 2016 in APB E005 Download Download
Übung Datalog / Q&A DS3, 27. Juni 2016 in APB E005 Download
Vorlesung Datalog Evaluation DS4, 30. Juni 2016 in APB E005 Download Download
Übung Datalog Evaluation DS3, 4. Juli 2016 in APB E005 Download
Vorlesung Graph Databases and Path Queries DS4, 7. Juli 2016 in APB E005 Download Download
Übung Path Queries DS3, 11. Juli 2016 in APB E005 Download
Vorlesung Database Theory in Practice DS4, 14. Juli 2016 in APB E005 Download Download


Kalender

Lade …