This is intended to give you a sense of what I think is important from the course so far, and what I will be thinking of when creating the exam.

Here are some disclaimers. This is not a contract. I may have inadvertently left something off this list that ends up in an exam question. I make no guarantees that the exam will be 100% limited to items listed below. Moreover, I will not be able to test all of this material given the time limitations of the exam. I will have to pick and choose some subset of it.

You are permitted one 8.5 x 11 sheet of paper with notes (both sides) for use as a reference during the exam.

Here are the specifics: Students should be able to...

Buffer pool manager: Be able to explain the need for a buffer pool manager vs. what OS does with specific situations. Be able to describe various replacement algorithms (LRU, MRU, clock) and predict which pages would be replaced under particular access patterns. Be able to describe a pattern that causes bad things for an arbitrary replacement algorithm. Be able to explain and/or utilize why and how dirty bit and pinning is used, and how pinning differs from locking.

Indexing: Be able to quantitatively describe advantages and disadvantages of indexing. Be able to define and quantitatively assess merit of indexing strategies such as primary, secondary, clustering, dense, and sparse. Demonstrate how an index-sequential file works and quantify usage costs. Be able to show detailed examples of how inserting and deleting works in B+ trees, extendable hashing, and linear hashing when sufficient assumptions on implementation are provided. Be able to explain advantages and disadvantages of each of the above techniques, and why each might be chosen. Be able to work out approximate I/O costs for retrieving data using a particular indexing technique.

Query Evaluation: Be able to explain and/or demonstrate...

• algorithms used for selection, projection, join, aggregation, set operations
• how approximate costs for such operations are calculated
• various join algorithms such as simple nested loops, block nested loops, index nested loops, sort merge join, and hash join, and I/O costs associated with these techniques
• external merge sort and associated costs

Query Optimization: Be able to evaluate alternative query evaluation strategies to determine which is more likely to be chosen. Be able to generate query evaluations strategies for a particular query, and indicate how to decide amongst them. Be able to describe how query optimizer approaches above problems, and show specific examples.

ACID: Be able to identify what the acronym stands for, what each of the four parts mean, and why each of them are important.

Finally, note that the practice exercises in the textbook are a great study tool -- all of them have solutions online at the textbook website.