Lecture: Tuesday and Thursday 5:00-6:20pm (zoom link will be provided)
Office hours: Tuesday 6:30-7:30pm, Thursday 3:30 - 4:30pm (zoom)
This course will present an overview of the theory of databases.
Topics include the theory of query languages, dependency theory,
deductive databases, incomplete information,
complex objects, and other advanced topics and research issues as time allows.
Connections will be made to relevant areas in logic and complexity theory.
Evaluation will be based on homework sets and a take-home final.
Text: Foundations of Databases
by S. Abiteboul, R. Hull, V. Vianu, Addison-Wesley, 1995.
Another useful reference:
L. Libkin: Elements of Finite Model Theory, Springer 2004
We will be using Piazza for class discussion. All class materials will continue to be posted
on this class web page (not Piazza).
Find our Piazza class page here and go to Q&A
to post or answer questions. Please make sure you are registered.
Slides and other resources
The relational model
Syntax and semantics of relational calculus
All readings are from the Foundations book unless otherwise noted.
|Undecidability of SAT-fin
|Conjunctive query minimization
||Ch. 17.2, also Ch. 3 in Libkin
||Ch. 17.3 (p.440), also Ch. 12 in Libkin
||Ch. 14.3, 15
|while and while+
Integrity of Scholarship
You are assumed to be familiar with the UCSD Policy on Integrity of
Scholarship and the course policy as described here.
All students en in this course implicitly agree to abide by the policies described in this document.
If you have any questions about these policies, be sure to discuss them with me.