Welcome to the Database Management Systems course, EECS-4411M, for winter term 2017. Materials, instructions, and notices for the course will accumulate here over the semester.

Class notices will accumulate here over the term. Be certain to check here regularly. (Refresh this page via your browser when you visit to ensure that you are not looking at an old, cached copy. Otherwise, you can miss the latest message.)

Marks accumulating on ePost.

• Final exam is 7–10pm Monday 10 April at DB #0005 (which used to be called the Tel Building). Preparation Guide.

• Project #3, Merg Join, is up and running.
  Due Tuesday 4 April 2017. (But no late penalty if turned in up until end of the week, Friday.)

• Project #2's due date extended to the end of Tuesday 21 March.

• Test #2 is on Thursday 9 March 2017.

• Test #1 returned, and marks out on ePost.

• Project #2, The Tipping Point, is up and running.
  Due Friday 17 March 2017.

• Project #1, The Buffer Pool Manager, is up and running.
  Due Friday 17 February 2017.

• Test #1 is on Thursday 2 February 2017.

  Add to readings for Test #1 Chapter 15 §6.1, which defines “clustering”.

• First lecture is 10am Thursday 5 January!

• Syllabus
  • The Course
  • Grading Criteria / Course Requirements
  • Calendar
  • Policies
• Lecture Notes
  Will be added throughout the course.
  0. introduction
     • introductory notes
       introduction
     • DBMS architecture
       DBMS architecture slide
  1. the physical database
     1. memory management [Ch.13]
        1. memory & storage
           memory & storage
           1. the memory hierarchy [Ch.13 §1]
           2. storage
              • secondary memory / disks [Ch.13 §2]
              • the I/O model & how to speed up access [Ch.13 §3]
              • coping with disk failures [Ch.13 §4]
        2. paging: disk organization & records
           disk organization
           1. pagification: arranging data on disk [Ch.13 §5]
           2. the buffer pool: representing block & record addresses [Ch.13 §6]
           3. variable-length data & records [Ch.13 §7]
        3. issues with modifying records [Ch.13 §8]
     2. index structures [Ch.14 §1–3,7,8]
        indexing (general, textbook)
        1. index structure basics [Ch.14 §1]
        2. B-trees [Ch.14 §2]
           overview of tree indexes
           B+ tree examples: see pages 9–20
        3. hash-table indexes [Ch.14 §3]
           hash indexes (general, textbook)
           hash indexes (alternate slides)
        4. bitmap indexes [Ch.14 §7]
  2. query processing
     overview (alternate slides)
     1. query execution: efficient algorithms for the operators [Ch.15]
        query operators (general, textbook)
        join algorithms (alternate slides)
        handling the other operators (alternate slides)
        1. overview of query-plan operators [Ch.15 §1]
        2. the algorithms
           1. one-pass algorithms [Ch.15 §2]
           2. nested-loop joins [Ch.15 §3]
           3. two-pass algorithms
              • by sorting [Ch.15 §4]
              • by hashing [Ch.15 §5]
        3. buffer (pool) management [Ch.15 §6]
        4. multi-pass algorithms [Ch.15 §7]
           • sort-based (“external sort”)
             external sort (alternate slides)
           • hash-based
     2. the query compiler: how to build good plans [Ch.16]
        query processing (general, textbook)
        query planning overview
        query planning exercise & work-through
        1. parsing & preprocessing [Ch.16 §1]
        2. query rewrite (R/W)
           1. algebraic laws for improving query plans [Ch.16 §2]
           2. from parse trees to logical query plans [Ch.16 §3]
        3. the cost-based optimizer
           1. estimating the cost of operations [Ch.16 §4]
           2. introduction to cost-based plan selection [Ch.16 §5]
           3. join enumeration: choosing an order for joins [Ch.16 §6]
           4. completing the query plan [Ch.16 §7]
  3. database management
     concurrency control (general / textbook)
     transaction processing continued (general / textbook)
     overview (alternate slides)
     concurrency control (alternate slides)
     1. coping with system failure [Ch.17]
        1. issues and models for resilience operations [Ch.17 §1]
        2. logging
           1. undo [Ch.17 §2]
           2. redo [Ch.17 §3]
           3. undo/redo [Ch.17 §4]
           4. protecting against media failures [Ch.17 §5]
     2. concurrency control [Ch.18 §1–5]
        1. serial & serializable schedules [Ch.18 §1]
        2. conflict serializability [Ch.18 §2]
        3. locking approaches
           1. enforcing serializabilty by locks [Ch.18 §3]
           2. locking systems withseveral lock modes [Ch.18 §4]
           3. an architecture for a locking scheduler [Ch.18 §5]
     3. beyond relational “stand-alone” servers
        1. scaling out
        2. systems for other data models

• Projects
  1. Project #1: The Buffer Pool Manager
     Due Friday 17 February 2017.
  2. Project #2: The Tipping Point (Query Planning)
     Due Friday 17 March 2017.
  3. Project #3: Merge Join
     Due Tuesday 4 April 2017.
• Tests
  1. Test #1
     • Preparation Guide
     • our Test #1: Test #1 (PDF), Test #1 w/ answers (PDF).
     • Test 1's from previous terms (for study purposes)
       • Winter 2014: Test #1 (PDF), Test #1 w/ answers (PDF).
       • Fall 2005: test (PDF), with answers (PDF)
       • Winter 2004: test (PDF), with answers (PDF)
       • Fall 2004: test (PDF), with answers (PDF)
     • Assignment #1's from previous terms (for study purposes)
       • Winter 2004: assignment (PDF), with answers (PDF)
       • Fall 2004: assignment (PDF), with answers (PDF)
  2. Test #2
     • Preparation Guide
     • our Test #2: Test #2 (PDF), Test #2 w/ answers (PDF).
     • Test II's from previous terms (for study purposes)
       • Winter 2014: test #2 (PDF), test #2 w/ answers (PDF).
       • Fall 2005: test (PDF), w/ answers (PDF)
       • Fall 2004: test (PDF), w/ answers (PDF)
       • Winter 2004: test (PDF), w/ answers (PDF)
     • Assignment II's from previous terms (for study purposes)
       • Assn #2 from Fall 2004: assignment (PDF), w/ answers (PDF)
       • Assn #3&4 from Fall 2004: assignment (PDF), w/ answers (PDF)
  3. Final Exam
     • Preparation Guide