Advanced Databases

Lecture:
Proseminar:
Language:
English
Office hours:
on demand (arranged via email)
Semester:
Winter 2017/2018
Course Evaluations:
PlusOnline:

Introduction

The course provides an in-depth understanding of the techniques, algorithms, and data structures that are used in database systems. The focus of the course is on the relational data model and the following topics will be covered:

Course schedule and exam dates are available in PlusOnline. You may register or cancel the registration up to 48 hours before the exam. If you do not show up for a registered exam, you will be blocked for this exam according to the university regulations.

Lecture

Literature

The lecture is mainly based on Chapter 14 (Transactions), Chapter 15 (Concurrency Control), and Chapter 16 (Recovery Systems) of the following book:

Silberschatz, Korth, Sudarshan.
Database System Concepts.
McGraw-Hill, 2011 (6th edition)

Multiple copies of the book are available in the textbook collection of the department library.

Slides

Thema Folien
1. Transactions:: Transaction Concept, Transaction State, Concurrent Executions, Serializability, Recoverability, Implementation Isolation, Transaction Definition in SQL, Testing for Serializability [1up] [4up]
2. Concurrency Control:: Lock-Based Protocols, Timestamp-Based Protocols, Validation-Based Protocols, Multiversion Schemes, Insert and Delete Operations, Concurrency in Index Structures [1up] [4up]
3. Recovery System: Failure Classification, Storage Structure, Recovery and Atomicity, Log-Based Recovery, Recovery Algorithm, Recovery with Early Lock Release and Logical Undo, ARIES [1up] [4up]

Reading

Please prepare for the lecture by reading the relevant sections in the textbook. The course is designed to be attended by students that have read the relevant contents in the textbook. During the lecture we will focus on examples, deepening discussions, and student questions.

Date Reading
2017-10-11 Ch 14
2017-10-18 Ch 15.1
2017-10-25 Ch 15.2–15.3
2017-11-08 Ch 15.4–15.5
2017-11-15 Ch 15.6–15.8
2017-11-22 Ch 15.9–15.10
2017-11-29 Ch 16.1–16.3
2017-12-06 Ch 16.4–16.6
2017-12-13 Ch 16.7–16.10

Exam

The exam will we written. In the case of very few registrations for an exam date, the exam will be held as an oral exam; in this case the students will be notified before the exam.

The exam dates will be announced on PlusOnline. Presumably there will be an exam (1) at the end of the semester, (2) before the summer break, and (3) in autumn.

How to prepare for the exam?

At the exam you are allowed to use one A4 sheet with your personal notes (both sides, hand written or printed).

You may register or cancel the registration up to 48 hours before the exam. If you do not show up for a registered exam, you will be blocked for this exam according to the university regulations.

Example exam: 19.05.2017

Proseminar

We will practice the concepts discussed in the lecture regarding transactions, concurrency, and recovery. We will exercise numerous techniques to deal with the problems related to these topics by solving theoretical and practical exercises.

Each lab has a dedicated exercise sheet which will be always published in advance.

Each lab sheet consists of two sections.

Schedule

Meetings Exercises Homework deadline Homework points
12.10.2017 Vorbesprechung --- ---
19.10.2017 Labs 1 27.10.2017 1
09.11.2017 Labs 2 17.11.2017 1
16.11.2017 Labs 3 24.11.2017 1
23.11.2017 Labs 4 | cookie_jar_h4.py 05.12.2017 1
30.11.2017 Labs 5 | cookie_jar_h5.py 12.12.2017 1
30.11.2017 Labs 6 --- ---
7.12.2017 Labs 7 | cookie_jar_h7.py 22.12.2017 1
14.12.2017 Labs 8 --- ---
11.01.2018 Labs 9 19.01.2018 2
18.01.2018 Labs 10 02.02.2018 2
25.01.2018 Labs 11 --- ---

Homework submission

Each homework must be submitted through our abgaben system before the deadline (no exceptions).

Access details will be sent by email.

Depending on the homework, you have to submit a TXT file or a Python script. See the details of each homework.

Evaluation

The evaluation is based only on the submitted homeworks with the following grading scale (1 point for each homework; 10 homeworks in total).

Points Mark
[8.75-10.00] 1
[7.50-8.75) 2
[6.25-7.50) 3
[5.00-6.25) 4
[0.00-5.00) 5