CS 334: Course schedule
To post a comment on a class reading, visit the Moodle class forum for discussing readings.
Note that if I specify reading such as a.b.c, this means all subsections as well (i.e., a.b.c.1, a.b.c.2, a.b.c.3, etc.).
Some of the readings get a bit long. It is my goal to assign readings that match the material we will then cover in class. That said, you should feel empowered to skim long portions. Your key goal in reading this material before class is to begin getting familiar with the ideas.
Schedule subject to change.
| # | Day | Topics | Assignment due (beginning of class) |
|---|---|---|---|
| 1 | M Apr 1 | Course overview | |
| 2 | W Apr 3 | Relational model (chapter 2) | Intro assignment |
| 3 | F Apr 5 | Relational algebra (chapter 6.1.1) | |
| 4 | M Apr 8 | SQL (chapter 3.3-3.5) | Relational model assignment |
| 5 | W Apr 10 | SQL (chapter 3.6-3.8) | Relational algebra assignment |
| 6 | F Apr 12 | Data modeling (first 7.5.1, 7.5.2, then skim 7.2, 7.3) | SQL Course Enrollment Part 1 |
| 7 | M Apr 15 | Design theory (chapter 8.1-8.2) | SQL Course Enrollment Part 2 |
| 8 | W Apr 17 | Exam 1 | |
| 9 | F Apr 19 | Design theory (chapter 8.3 start-8.3.4, 8.4.1) | More SQL Problems 1 and 2 |
| 10 | M Apr 22 | Design theory (8.4.2, 8.4.4, 8.4.5, 8.5.1) | SQL Injection |
| 11 | W Apr 24 | Disks; block organization (10.1, 10.2, 10.5) | More SQL Problem 3 |
| 12 | F Apr 26 | Disks: file organization (10.6-10.8 [skip 10.6.2]) | Design theory: analytical |
| 13 | M Apr 29 | Catchup on file organization | Design theory: programming |
| 14 | W May 1 | Indexing overview (11.1-11.2) | |
| 15 | F May 3 | Margo Seltzer visit | Block organization part 1 |
| M May 6 | BREAK | ||
| 16 | W May 8 | Catching up on indexing, no new reading | Block organization part 2 |
| 17 | F May 10 | Exam 2 | |
| 18 | M May 13 | B+ trees (11.3 start-11.3.2, 11.3.3-11.3.5) | |
| 19 | W May 15 | Static / Extendable hashing (11.6-11.8) | |
| 20 | F May 17 | Query processing (12.1-12.3) | B+ tree |
| 21 | M May 20 | Sort, join algorithms (12.4-12.5.2) | Extendable hashing |
| 22 | W May 22 | Join algorithms (12.5.3-12.5.5) | |
| 23 | F May 24 | More query processing (12.6-12.7, 13.1) | Query processing textbook problems |
| 24 | M May 27 | Query optimization (13.2-13.3) | Query optimization textbook problems |
| 25 | W May 29 | Exam 3 | |
| 26 | F May 31 | Transactions (14-14.4) | Optimization of slow queries |
| 27 | M June 3 | NoSQL (NoSQL chaps 1-6) | NoSQL paper references (Tues 10pm) |
| 28 | W June 5 | NoSQL (NoSQL chaps 8-11) | |
| EW | NoSQL paper due |