Data Management (academic year 2017/2018)



For whom is this course. This 6 credits course is for the students of the Master of Science in Engineering of Computer Science (School of Engineering) of the Sapienza Università di Roma. This course is also for students of Ingegneria Gestionale of the same School. The language for both the course and the exam is English. The lectures will be held in the first semester (September 2017 - December 2017).
Prerequisites. A good knowledge of the fundamentals of Programming Structures (algorithms and data structures), Programming Languages, Databases (SQL, relational data model, Entity-Relationship data model, conceptual and logical database design), Theoretical Computer Science (computational complexity, computability) is required.
Course goals. The course presents the basic concepts of database systems. Several major issues related to the theory and the design of database systems are covered, including concurrency control, recovery, file and index organizations, query processing.


  • News
    • November 17, 2017 The tentative dates for the first two exams are: 12/01/2018 (9:00 am), and 06/02/2018 (9:00am).
  • Lecture material
    • M. Lenzerini, Lecture notes (slides to download)
      Students can download the course slides by accessing the MOODLE system at this page.
      The slides will be available during the lecture period. Please, note that all students of Sapienza can access the MOODLE system by using the user name and the password of the university
    • R. Ramakrishnan, J. Gehrke. Database Management Systems. McGraw-Hill, 2004
    • Students willing to read more about concurrency control can freely download an excellent book from the following site: http://research.microsoft.com/en-us/people/philbe/ccontrol.aspx
      If one is looking for a more modern book, which is not free, a good suggestion is:
      Gerhard Weikum, Gottfried Vossen, "Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery", The Morgan Kaufmann Series in Data Management Systems.
  • Lectures
    • Monday: [08:00am - 10:00am], via Eudossiana 18, classroom 11,
    • Tuesday: [02:00pm - 04:00pm], via Eudossiana 18, classroom 29,
    • Friday: [10:00am -- 11:00am] via Eudossiana 18, classroom 41.

    Week Monday (08:00am - 10:00am) classroom 11 Tuesday (02:00pm - 04:00pm) classroom 29 Friday (10:00am - 11:00am) classroom 41
    01 (Sep 25) Lectures 1,2
    - Course overview
    - Relational data model
    ------
    Lectures 3
    - Recap of relational algebra and SQL
    02 (Oct 02) Lectures 4,5
    - Buffer management
    - Transaction management
    Lectures 6,7
    - Serializability
    - View equivalence and serializability
    Lectures 8
    - Monotonicity of classes of schedules
    - Algorithms for view serializability
    03 (Oct 09) Lectures 9,10
    - Conflict equivalence
    - Conflict serializability
    - Conflict serializability theorem
    Lectures 11,12
    - Locking protocols
    - The two-phase locking protocol
    Lectures 13
    - Deadlock in locking protocols
    - Exercises on concurrency
    04 (Oct 16) Lectures 14,15
    - Recoverability
    - Strict and rigorous schedules
    - Strict 2PL protocol
    ------
    Lectures 16
    - Timestamp-based scheduler
    - Multiversion concurrency control
    - Concurrency in SQL
    05 (Oct 23) Lectures 17,18
    - Recovery in DBMSs
    - Introduction to file organizations
    Lectures 19,20
    - Simple file organizations
    - 2-way external sorting
    Lectures 21
    - k-way external sorting
    - The notion of index
    - Types of indexes
    06 (Oct 30) Lectures 22,23
    - The notion of index
    - Types of indexes
    Lectures 24,25
    - Clustering sorted indexes
    - Non-clustering sorted indexes
    ------
    07 (Nov 06) Lectures 26,27
    - Clustered files
    - Exercises on sorting and sorted indexes
    Lectures 28,29
    - MongoDB: a non-relational database management system
    (Prof. Domenico Lembo)
    Lectures 30
    - Tree-based indexes
    08 (Nov 13) Lectures 31,32
    - Hash-based indexes
    - Exercises on file organizations
    Lectures 33,34
    - Exercises on file organizations
    Lectures 35
    - Evaluation of relational operators: classification of algorithms
    09 (Nov 20) Lectures 36,37
    - One pass algorithms
    Lectures 38,39
    - Evaluation of relational operators: nested loop algorithms
    Lectures 40
    - Evaluation of relational operators: two pass algorithms
    10 (Nov 27) Lectures 41,42
    - Evaluation of relational operators: two pass algorithms
    11 (Dec 04)
    12 (Dec 11)
    12 (Dec 18)
    ------
  • Exercises
  • Topics covered
    • 1. The structure of a Data Base Management System (DBMS)
    • 2. Concurrency management: The concept of transaction, The notion of serializability, Concurrency management strategies
    • 3. Recovery: Crash management, Classification of failures, Recovery strategies
    • 4. Buffer management: buffer pool, replacement strategies, operations on the buffer
    • 5. Physical structures for data bases: Record and page organizations, Simple file organizations, Indexed file organizations
    • 6. Query processing: The notion of access path, Evaluation of relational algebra operators
    • 7. NoSQL databases: The case of document-oriented databases and MongoDB
  • Exam
    • Final exam: the final exam is constituted by a written exam, and a possible oral examinations. Students have 2 hours for completing the written exam
    • Past written exams: you can have a look at the texts of past exams
    • To book for the exam: Please, follow the on-line booking procedure.
    • Schedule of exams:
      • First written exam: January 2018
      • Second written exam: February 2018
      • Special exam session (only for "fuori corso" and "part-time" students): April 2018
      • Third written exam: June 2018
      • Fourth written exam: July 2018
      • Fifth written exam: September 2018
      • Second special exam session (only for "fuori corso" and "part-time" students): October 2018
  • Information about course evaluation by students
    • Data about the evaluation of the course by students of the previous editions are available in the home pages of the corresponding editions (see below). Data about the 2017-2018 edition will be posted here as soon as they are available.
  • Information on past editions of this course
  • Office hours. Tuesday, 5:00 pm, at the Dipartimento di Ingegneria Informatica Automatica e Gestionale "Antonio Ruberti", via Ariosto 25, Roma, second floor, room B203 (if available), or room B217 (otherwise) -- please, look at the last minute news for the next office hours