CS 455: Principles of Database Systems  (Fall 2019)

Instructor: David Chiu
Meeting Time: MWF 3:00-3:50 in Thompson Hall 395
Office: Thompson Hall 390 B
Office Hours: Open door, or by appointment
Canvas: canvas.pugetsound.edu


The course syllabus contains general information on course topics, grading procedures, and classroom policies.


Homework Assignments


Course Schedule (Tentative)

Week 1 (Silberschatz, et al.: Chap 1 and 2)

Mon 09/02Wed 09/04Fri 09/06 etc.

Labor Day (no class)

Why DBMS? Data independence

Relational model: connection to set theory

Week 2 (Silberschatz, et al.: Chap 2 and 6.1)

Mon 09/09Wed 09/11Fri 09/13
Hwk 1 due

Relational model: keys, schema diagrams

Relational algebra (RA): select, project, set operators

RA: expression trees, composition

Review Guide 1: Basics

Week 3 (Silberschatz, et al.: Chap 6.1)

Mon 09/16Wed 09/18Fri 09/20
Project 1 due

RA: natural and theta join; projecting costs

RA: outer joins, rename, NULL values, rename

RA: aggregation and grouping

Review Guide 2: Rel. Algebra (Soln)

Week 4 (Silberschatz, et al.: Chap 3-4)

Mon 09/23Wed 09/25Fri 09/27
Hwk 2 due

Start SQL: defining schema; integrity constraints

SQL: selection, joins, set ops

SQL: rename, temporary refs, subqueries

SQLite Download Page
SQLite Browser

Week 5 (Silberschatz, et al.: Chap 3-4)

Mon 09/30Wed 10/02Fri 10/04 etc.

SQL: rename, temporary refs, subqueries

SQL: grouping and aggregation

SQL: more examples

Week 6

Mon 10/07Wed 10/09Fri 10/11 etc.

SQL: triggers, transactions


Midterm Exam I

Review Guide 3: SQL (Soln)

Week 7 (Silberschatz, et al.: Chap 8)

Mon 10/14Wed 10/16Fri 10/18 etc.

DB theory: functional dependency (FD)

Armstrong's axioms and deriving inference rules

Attribute closure and keys

Week 8 (Silberschatz, et al.: Chap 8)

Mon 10/21Wed 10/23Fri 10/25 etc.

Fall Break

Normal forms: 1NF, 2NF

BCNF; Canonical cover of FD sets

Review Guide 4: Theory

Week 9 (Silberschatz, et al.: Chap 10)

Mon 10/28Wed 10/30Fri 11/01 etc.

Start files: Format tradeoffs

File organization of tuples

Cost analysis: common relational operators

Week 10 (Silberschatz, et al.: Chap 10)

Mon 11/04Wed 11/06Fri 11/08 etc.

Join processing: hashjoin, sort-merge join


Midterm Exam II

Week 11 (Silberschatz, et al.: Chap 11)

Mon 11/11Wed 11/13Fri 11/15 etc.

Start Indexing

B+Tree: properties, operations

B+Tree (cont.): complexity

Week 12 (Silberschatz, et al.: Chap 11)

Mon 11/18Wed 11/20Fri 11/22 etc.

Extendible hashing

Bitmap indexing


Review Guide 5: Indexing (Soln)

Week 13 (Silberschatz, et al.: Chap 14)

Mon 11/25Wed 11/27Fri 11/29 etc.

Start transactions: ACID properties, schedules, conflicts

Week 14 (Silberschatz, et al.: Chap 14-15)

Mon 12/02Wed 12/04Fri 12/06 etc.

Transactions: conflict equivalence and serializability

Transactions: recoverability; concurrency control

Concurrency protocols: 2PL and variants

Review Guide 6: Transactions

Week 15

Mon 12/09Wed 12/11Fri 12/13 etc.

Project Demos

Project Demos

Reading Period

Finals Week

Mon 12/16Wed 12/18Fri 12/20 etc.

Final Exam: 4:00-6:00

   Department of Mathematics and Computer Science
University of Puget Sound
1500 N. Warner St
Tacoma, WA 98416