Some exercises to study before the final.

You may turn in the ones marked with * by Monday morning, Dec 8, 
for up to 8 points of midterm extra credit. I will post solutions
at about noon on Monday; it is your responsibility to be sure I have
received any work you choose to submit for credit *before* the
solutions are posted!

Makeup work may increase your midterm score to a maximum of: 80
Max makeup points you can earn by submitting solutions here:  8
Max makeup points you can earn by submitting alternative project: 16

Chapter 8: basics of indexes
 8.3
*8.4: some indexes
*8.11, part 1
 8.11, part 2

Chapter 10: B+ trees
*10.1: part 1, 2
*10.4, part 1

Chapter 11: hashing
11.1

Chapter 12: query evaluation basics
*12.2
*12.5, part 1
 12.5, part 2

Chapter 14: query evaluation II
*14.2
*14.4, parts 1-4
       For part 3, assume that R can be sorted with 4 passes (read and write 
       for each pass), and S can be sorted with 3 passes.
 14.5, part 1

Chapter 15: query optimization
*15.4, parts 2 and 3
*15.7, parts 1, 2, 3a
 15.9, parts 2 and 6a

Chapter 16: transactions
 16.2
*16.3
*16.5, part 1
 16.7

Chapter 17: transaction implementation
*17.2, parts 1-8 (for the first 4, abort/commit does not matter)
 17.4, parts 1, 2, and 3

Chapter 18: ARIES crash recovery
*18.3 (be sure to show all tables at end of each phase)
 18.4, parts 1 and 2

Chapter 20: database tuning
*20.1
 20.2, part 1