| Week | Date | Topic | Notes* | Slides** | Reading |
| 1 | 2003-01-08 | Introduction | |||
| 2 | 2003-01-13 | Relational model and algebra | A Relational Model of Data for Large Shared Data Banks, by Codd (in red book). | ||
| 2003-01-15 | Relational database design | ||||
| 2003-01-17 | Recitation session: E/R model and design | ||||
| 3 | 2003-01-20 | Martin Luther King, Jr. Day holiday | A History and Evaluation of System R, by Chamberlin et al. (in red book). | ||
| 2003-01-22 | SQL schema definition and query basics | ||||
| 4 | 2003-01-27 | SQL subqueries, aggregates, NULL's | A Critique of the SQL Database Language, by Date. SIGMOD Record, 14(3), 1984. | ||
| 2003-01-29 | SQL modifications, constraints, triggers, views | ||||
| 2003-01-31 | Recitation session: SQL | ||||
| 5 | 2003-02-03 | SQL index, transactions, and application programming | A History and Evaluation of Critique of ANSI SQL Isolation Levels, by Berenson et al. SIGMOD 1995. Weaving Relations for Cache Performance, by Ailamaki et al. VLDB 2001. |
||
| 2003-02-05 | Physical data organization | ||||
| 2003-02-07 | Recitation session: SQL programming and Homework #1 | ||||
| 6 | 2003-02-10 | Indexing: basics, ISAM, B-tree | The Evolution of Effective B-tree Page Organization and Techniques: A Personal Account, by Lomet. SIGMOD Record, 2001. R-Trees: A Dynamic Index Structure for Spatial Searching, by Guttman. SIGMOD 1984 (in red book). Generalized Search Trees for Database Systems, by Hellerstein et al. VLDB 1995 (in red book). |
||
| 2003-02-12 | Indexing: R-tree, GiST | ||||
| 7 | 2003-02-17 | Data stream management (guest lecture by Jennifer Widom) | A Study of Index Structures for Main Memory Database Management Systems, by Lehman and Carey. VLDB 1986. | ||
| 2003-02-19 | Indexing: more GiST, hashing | ||||
| 2003-02-21 | Recitation session: Homework #2 | ||||
| 8 | 2003-02-24 | Indexing: more hashing, text indexing | Cache Conscious Indexing for Decision-Support in Main Memory, by Rao and Ross. VLDB, 1999. Making B+-Trees Cache Conscious in Main Memory, by Rao and Ross. SIGMOD, 2000. |
||
| 2003-02-26 | Main-memory indexing | ||||
| 2003-02-28 | Recitation session: midterm review | ||||
| 9 | 2003-03-03 | Midterm exam | Query Evaluation Techniques for Large Databases, by Graefe. ACM Computing Surveys, 1993. | ||
| 2003-03-05 | No class | ||||
| 10 | 2003-03-10 | Spring recess | |||
| 2003-03-12 | Spring recess | ||||
| 11 | 2003-03-17 | Query processing: scan, sort, hash | Improved Query Performance with Variant Indexes, by O'Neil and Quass. SIGMOD, 1997 (in red book). | ||
| 2003-03-19 | Query processing using indexes | ||||
| 2003-03-21 | Recitation session: midterm common problems | ||||
| 12 | 2003-03-24 | Query processing: systems view | An Evaluation of Buffer Management Strategies for Relational Database Systems, by Chou and DeWitt. VLDB, 1985 (in red book). Query Rewrite Optimization Rules in IBM DB2 Universal Database, by Leung et al. (in red book). |
||
| 2003-03-26 | Buffer management | ||||
| 2003-03-28 | Recitation session: quiz | ||||
| 13 | 2003-03-30 | Query optimization: rewrite | Improved Histograms for Selectivity Estimation of Range Predicates, by Poosala et al. SIGMOD, 1996. Access Path Selection in a Relational Database Management System, by Selinger et al. SIGMOD, 1979 (in red book). |
||
| 2003-04-02 | Query optimization: cost estimation | ||||
| 2003-04-04 | Recitation session: quiz | ||||
| 14 | 2003-04-07 | Query optimization: algorithms | Randomized Algorithms for Optimizing Large Join Queries, by Ioannidis and Kang. SIGMOD, 1990. Online Aggregation, by Hellerstein et al. SIGMOD, 1997 (in red book). Eddies: Continuously Adaptive Query Processing, by Avnur and Hellerstein. SIGMOD, 2000. |
||
| 2003-04-09 | Online query processing and optimization | ||||
| 15 | 2003-04-14 | Transaction processing: concurrency control | |||
| 2003-04-16 | Transaction processing: recovery | ||||
| 2003-04-18 | Recitation session: Homework #4 | ||||
| 16 | 2003-04-21 | More recovery; end-semester logistics | |||
| 17 | 2003-05-01 | Final exam (D243 2-5pm) |
* Generally available in the morning on the day of the lecture. They are intentionally made incomplete in order to keep the lectures more lively. You can print these slides out and use them for taking notes during the lecture. These slides may contain typos/errors that are corrected only in the complete version.
** Available on the same day after the lecture. They are complete, with typos/errors corrected.
| Assignment | Download | Assigned | Due |
| Homework #1 | Wednesday, 2003-01-22 | Monday, 2003-02-10 | |
| Homework #2 | Wednesday, 2003-02-12 | Wednesday, 2003-02-26 | |
| Homework #3 | Wednesday, 2003-03-26 | Wednesday, 2003-04-09 | |
| Homework #4 | Wednesday, 2003-04-09 | Wednesday, 2003-04-23 | |
| Project | Wednesday, 2003-01-22 | See project description |