Topics

• Review of relational query languages: SQL, algebra, calculus
• Data Storage Issues
• Index Structures: conventional, multi-level, B-Trees, Hashing
• Query Execution: rewritings, algorithms for algebra operators
• Transactions and Concurrency Control

Schedule

• Lectures: Tuesdays, Thursdays, 3:55-5:15, APM 4218
• Instructor: Bertram Ludäscher, SDSC R367, ludaesch@sdsc.edu
• Office Hours: immediately after classes (@APM) or by appointment (@SDSC)

Recommended Texts

1. Database System Implementation, Garcia-Molina, Widom, Ullman, Prentice-Hall
2. Foundations of Database Systems, Abiteboul, Hull, Vianu, Addison-Wesley

Slides

1. SQL and relational algebra review: [s.1-s.18.pdf]
2. Motivation and course overview: [s.19-s.25.pdf]
3. Physical storage aspects: [s.26-s.33.pdf]
4. Indexes I: [s.34-s.50.pdf]
5. Indexes II (B-Trees): [s.51-s.57.pdf], [s.58-s.66.pdf]
6. Indexes III (Hashing+Multidimensional Indexes): [s.67-s.88.pdf]
7. Query Evaluation: [s.89-s.101.pdf], [s.102-s.112.pdf]
8. [Midterm.pdf]
9. Query Evaluation: [s.113-s.133.pdf]
10. Transaction Processing: Recovery [s.134-s.147.pdf]
11. Transaction Processing: Concurrency Control [s.148-s.177.pdf]
12. [FINAL.pdf] (with solutions)

Exercises (voluntary, ungraded)

1. SQL and RA [.pdf]
2. Indexes [.pdf]
3. Some Practice Problems (and some solutions) [.pdf]
4. More Practice Problems (and more solutions) [.pdf]