Welcome to COSC-6421(M), Advanced Database Systems, for winter term 2007.

Materials, instructions, and notices for the course will accumulate here over the semester.

Course notices will accumulate here over the term. Be certain to check here regularly.

Also, be certain to 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.

• Winding up.

  • Reports due Tuesday 10 April.
  • Final exam (PDF) will be take-home and posted presently. It will be due due by 11:59pm Wednesday 18 April 2007.

  There is some flexibility on these on a case-by-case basis. Give me a heads up as soon as possible if you are faced with conflicts.

• Syllabus
• Lecture Notes
  1. Introduction PDF, PDF (2-per)
  2. Logic
     1. semantics
        1. logic primer & datalog (36 pages): PDF, PDF (2-per)
        2. prolog diversion (14 pages): PDF, PDF (2-per)
        3. datalog w/ negation (9 pages): PDF, PDF (2-per)
        4. well-founded & stable model semantics (8 pages): PDF, PDF (2-per)
     2. query languages:
        1. datalog examples: ...
        2. relational calculus examples: ...
        3. SQL
           • the relational model [chapter 3]*, for review (34 pages): PDF, PDF (2-per)
             Includes basic constraints, DDL / data definition language (e.g., create table), & DML / data manipulation language (e.g., insert).
           • queries, constraints, & triggers [chapter 5]* (35 pages): PDF, PDF (2-per)
           • SQL examples: PDF, PDF (2-per)
  3. Systems
     1. RDBMS architecture chart (1 page): PDF
     2. the physical database
        1. overview of storage & indexes [chapter 8]* (32 pages): PDF, PDF (2-per)
        2. storing data: disks and files [chapter 9]* (29 pages): PDF, PDF (2-per)
        3. tree-structured indexing [chapter 10]* (26 pages): PDF, PDF (2-per)
        4. hash-based indexing [chapter 10]* (19 pages): PDF, PDF (2-per)
  * Derived from the textbook slides by Ramakrishnan and Gehrke.
• Readings (You have to authenticate to reach here. This is to respect copyright on materials.)
• Materials
  • peggly: A prolog implementation of the game of peggly, as discussed in class. This also provides code to trace and print the proof tree.
  • DB2 and SQL:
    • DB2 on PRISM (local)
    • From IBM:
      • SQL, Getting Started (old, v6, but useful)
      • SQL Reference (old, v6, but useful)
      • DB2 Version 7 Information Center

• Assignments
  1. Assignment #1: PDF
     Due Thursday 22 February 2007.
     Note that, for the game of stones, it might be easier to implement it than to trace by hand. See the prolog program peggly under §Materials.
  2. Assignment #2 (SQL)
     Due Friday 16 March 2007. (A few days grace is fine.)
  3. Assignment #3: PDF
     Due Tuesday 3 April 2007.
• Presentation
  • Schedule
• Project
• Exam
  • PDF
    Due by 11:59pm Wednesday 18 April 2007.