Date | Book Chapter |
Topic | Suggested Book Exercises |
Remarks |
August 25 | 1 | Course overview and introduction to data management (slides) | 1.1-1.6 | Please print and sign academic integrity form for next class |
August 28 | 2 | ER model (slides) Additional reading: Peter Chen. Entity-Relationship Modeling: Historical Events, Future Trends, and Lessons Learned. In Software Pioneers: Contributions to Software Engineering, Broy M. and Denert, E. (eds.), Springer-Verlag, Berlin, Lecturing Notes in Computer Sciences, June 2002, pp. 100-114
|
2.1 to 2.8 | Bring signed academic integrity form to class |
August 30 | 3 | Relational model
(slides) Additional reading: C.J. Date. Dr. Edgar F. Codd: Passing of a Pioneer. Intelligent Enterprise, April 25, 2003. |
3.1-3.7, 3.10-3.17 | |
September 1 | 3, 8 | Relational model Additional reading: E.F. Codd. A Relational Model of Data for Large Shared Data Banks. Communications of the ACM, Vol. 13, No. 6, June 1970, pp. 377-387. File organization and indexing, disks and files (slides) |
8.1-8.11 | |
September 4 | 8, 9 | File organization and indexing, disks and files (Contd.) | 9.1-9.4, 9.7-9.14 9.16-9.20, 9.22 | |
September 6 | 8, 9 | File organization and indexing, disks and files (Contd.) | ||
September 8 | 4 | Relational algebra (slides) | 4.1-4.7 (ignore tuple relational calculus) | |
September 11 | 5 | Relational algebra (slides) | ||
September 13 | 5 | SQL (slides) | 5.1-5.5, 5.7-5.8, 5.10 | |
September 15 | 5 | SQL | ||
September 18 | 5 | In-class practice: Relational algebra and SQL | Homework 1 out | |
September 20 | 10 | Files and indices (slides) Tree structured indexing (slides) |
10.1-10.5, 10.7-10.11 | |
September 22 | 10 | Tree structured indexing | ||
September 25 | 11 | Tree structured indexing | ||
September 27 | 11 | Hash-based indexing (slides) | 11.1-11.10 | |
September 29 | 13 | External sorting (slides) | 13.1-13.5 | Homework 1 due in class, homework 2 out |
October 2 | 14 | Evaluation of relational operators (slide set one) | 14.1-14.7 | |
October 4 | 12, 14 | Evaluation of relational operators | ||
October 6 | 14 | Exercise practice: Exercise 13.4 | ||
October 9 | No class (fall break) | |||
October 11 | 14 | Evaluation of relational operators (slide set two) | ||
October 13 | 15 | Evaluation of relational operators | 15.1-15.5, 15.7-15.9 | |
October 16 | 15 | Query optimization (slides) Additional reading:
|
Homework 2 due via CMS at 23:59pm | |
October 18 | Pre-midterm discussion | |||
October 19 | Midterm Exam, 7:30pm | |||
October 20 | 15 | Query optimization | ||
October 23 | 15 | Query optimization | Homework 3 out | |
October 25 | 16, 17 | Concurrency control | 16.1-16.3 | |
October 27 | 17 | Concurrency control | 17.1, 17.2, 17.4-17.8, 17.10-17.12 | |
October 30 | 17 | Concurrency control | ||
November 1 | 18 | Recovery | 18.1-18.5, 18.7, 18.8 | |
November 3 | 18 | Recovery | Homework 3 due, homework 4 out | |
November 6 | 18 | Recovery | ||
November 8 | 19 | Schema design and normal forms | 19.1-19.8, 19.10-19.12, 19.24, 19.25 | |
November 10 | 19 | Schema design and normal forms | ||
November 13 | 19 | Schema design and normal forms | ||
November 15 | 20 | Database tuning | 20.1-20.9 | |
November 17 | 22 |
Distributed
transaction management Two-phase commit is also explained well in the following paper: C. Mohan, Bruce G. Lindsay, Ron Obermarck: Transaction Management in the R* Distributed Database Management System. ACM Trans. Database Syst. 11(4): 378-396 (1986). http://portal.acm.org/citation.cfm?doid=7239.7266 |
22.14 | Homework 5 out |
November 20 | 21 | Database security | 21.2, 21.4 | Homework 4 due |
November 22 | No class (Thanksgiving break) | |||
November 24 | No class (Thanksgiving break) | |||
November 27 | 22 | Parallel database systems | 22.3, 22.4, 22.5 | |
November 29 | 28 | Spatial data management | 28.1, 28.3, 28.4, 28.5 | |
December 1 | 25 | Data warehousing and OLAP | 25.1 | Homework 5 due |