After successful completion of the course, students are able to

• classify basic concepts of and techniques for information systems;
• explain the concept of data independence, describe different data models and asses the advantages and disadvantages of these data models for different applications;
• interpret concepts UML2 object- and class diagrams as well as the relational data model and apply them in order to express given facts;
• abstract relevant concepts from a situation described in natural language, model them in the aforementioned diagrams and derive relational schemas from them;
• devise relational schemas (including mechanisms for guaranteeing given integrity constraints on the data) and to implement them in SQL on a relational database management system (RDBMS);
• assess and improve the quality of a relational schema;
• manipulate and query data stored under a relational schema using SQL;
• comprehend and independently formulate database queries in SQL and the Relational Algebra (this includes being able to formalize requests/queries given as natural language);
• describe basic relationsships and constraints using formal dependencies.

• Introduction, Basics, Overview
• Data Models, Database Systems, Data Independence
• The Relational Model (Basics, Design)
• Relational Query Languages
• Relational Algebra
• SQL
• Conceptual Modelling
• UML2
• Object Diagram
• Class Diagram
• Dependency Theory and Relational Design Theory (Dependencies, Normal Forms)

The course consists of lectures and exercises.   The content of the course is presented in the lectures:

• Most of content is presented in a classical lecture (recordings of these are provided in TUWEL)
• To each lecture, a short quiz will be provided in TUWEL
• Additional information to each topic may be provided in TUWEL (which might be obligatory or voluntary)
• At the start of each lecture, (at least) 30 minutes are reserved for questions by the students/discussion concerning the content of the course so far, the additional material, the quizzes, the exercises, etc. Presentation of new material does not begin earlier than 30 minutes after the start of the lecture.

In the exercise part of the course, the application of the presented methods, concepts, and algorithms is trained.

• The exercise part consists of four exercise sheets, which are solved by the students as  a homework and handed in.
• Practicing the formulation of SQL queries (which is part of at least one exercise sheet) is done in an online tool. Exercises further include the implementation of small programs using a database management system (Postgres or SQLite) as well as solving exercises "with pen and paper".
• The lecturer and teaching assistants offer online consultation hours.
• The exercises are checked by the teaching assistants, graded by the lecturer and returned to the students (enhanced with some feedback)
• The correct solutions are presented by the lecturer in a format to be decided later.

Preliminary Meeting: October 6th, 6.15 pm as announced

Contact: In case of any questions, please contact gdi@list.tuwien.ac.at

Material:

All material (slides, lecture recordings, exercise sheets) as well as additional organisational information are provided in the accompanying TUWEL-course.
The course is given in German!

ECTS Breakdown:

20h   lectures
15h   preparation for and repetition of lectures
20h   solving exercise sheets
18h   exam preparations
 2h   exams
------------------
75h (= 25h * 3ECTS)

The final evaluation is based on the performance at the exercises (evaluation is based on the submission), the participation during the course, a the computer-based SQL-test and a computer based TUWEL-Test.

This course is exclusively for students of the program 045 006 "Digital Skills". Registrations with a different code unfortunately will be rejected.

Please also note that you have to successfully finished both, the STEOP in your main program and the course  "Foundatoins fo programming and algorithms".

Basic Python programming skills as taught in the lecture "Grundlagen der Programmierung und Algorithmis" are advantageous.