CS 348 Database Systems - Exam 2 Study Guide

1. Here's a sample exam 2 from a previous iteration of this course. This exam has no questions about file organizations and indexes (we hadn't covered it yet).
2. Review your second quiz.
3. Review RAID levels, how they store data, and the advantages and disadvantages of each level in terms of performance, cost, and complexity.
4. Write the delete function for our Java implementation of a linked sequential file.
5. Look at the following practice problems from chapter 10; 10.4 and 10.5.
6. Review terms on page 469-470.
7. Indexing. What is an index? What is a dense and sparse index?
8. What is a multilevel index? Draw an example of one.
9. What is an indexed sequential file?
10. Build the 2-3 tree for a sample list of keys. (Use the example from class to check that you are right.)
11. Chapter 11 practice problem 11.1, 11.3
12. Understand the properties of a B-Tree and advantages and disadvantages over the indexed sequential file structures we covered.