ADATBÁZIS RENDSZEREK

DATABASE SYSTEMS

 

 

Lecturer:       Ágnes Bércesné Novák

Instructors:   Zoltán Fodróczi, Gergely Soós

Assistants:     Tamás Csillag, László Füredi, Zsolt  Kada,  Anna Lázár, Zoltán Kárász, Tünde Szilágyi , Péter Vízi

 

Course description

 

Lab and seminar material can be found here.

 

2005. FEBR 15. Information systems, database systems. General purpose database system architecture.  Silberschatz slides.  Lecture slides .

                             Design I.: Entity / Relationship model, basics. Silberschatz slides. (slides 1-56 only)

 

2005. FEBR 22. Design II.: From entity relationship to relational model. Silberschatz slides.  (slides 57-67 only) Keys.

 

2005. MARCH 1. Query languages I.: Relational algebra. Silberschatz slides (1-44 only). Lecture slides (1 - 49 pages only). Maximum example. How to express division by basic operators? Interactive relational algebra: in Hungarian, in English.

 

2005. MARCH 8. Query languages I.I: Structured Query Language, SQL (= SEQUEL). Silberschatz slides.  (slides 1-46 only).

         Silberschatz creating and populating tables.  Lecture notes.

 

2005. MARCH 15. NATIONAL HOLIDAY.  Learn SQL on your own: Tutorial 1.  Tutorial 2.

 

2005. MARCH 16. SQL TUTORIAL 17.30

 

2005. MARCH 22. MIDTERM TEST: 7.45 AM.

 

CONSULTATION FOR THE MIDTERM: Monday AFTERNOON (Zoltán Fodróczi)

Material for the midterm: See listed files above.

Typical problems, questions:

-        getting relational model from E/R

-        getting E/R from specification

-        relationship types, their keys

-        definitions covered int he lectures

-        Rewrite a query given in English (Hungarian) to SQL, Relational Algebra (RA)

-        Rewrite a given SQL query into RA query

-        Rewrite a given RA query into SQL

 

2005. APRIL 20.

Concurrent transactions: notion of a transaction, schedules, serial, serializable schedules: conflict-, view -eqvivalency. Precedence graph for conflict eqvivalent schedules. 2 Phase protocol.

Lecture outline. Detailed slides (by Judit Csima, writen for PPKE students). Silberschatz slides. (all slides from chapter 15.) Silberschatz slides (cont.) (only slides 16/1-14, 16/18-24, 16 refers to the chapter number.)

 

2005. APRIL 26.

Functional dependencies. Silberschatz slides (only pages 7/1-21, 7/27-31, 7/33-38, 7/40-43, 7 refers to the chapter number.)

 

2005. APRIL 29. Pitfalls. Normalization. Lecture notes.

 

2005. MAY 3.

Timestamp based protocol: See Lecture outline on 20th of  April, and Silberschatz slides Chapter 16. (only slides 18-24).

 

Recovery systems: Lecture slides: 1, 2, 3, 4. Silberschatz slides. (only pages 17/1-37).

 

 

2005. MAY 10. 7.45: FINAL  TEST. ( you may take the oral exam only if both Midterm Test and Final Test is at least satisfactory)

 

2005. MAY 17. Exam questions. Deciding lossless decomposition by tabular method: See Lecture notes on 29th of April.

Dependency preserving decomposition.