Final Exam Review

Tom Kelliher, CS 318

May 3, 2002

Administrivia

Announcements

Assignment

From Last Time

Atomic, durable, and distributed transactions.

Outline

1. Course evaluation.

2. Review for final.

Coming Up

Project demos and final.

Review For Final

• Chapters covered: 8, 9, 11, 14, and 15.

• Same format as last time:
  1. Short answer/definition: 4 @ 15 points each.

  2. Problem solving: 2 @ 20 points each.

• This exam will count for 22.5% of final grade, as will the midterm.

1. Normalization:
   1. Functional dependencies, closure, attribute closures. Use in checking entailment.

   2. Decompositions: lossless, dependency preserving.

   3. Minimal covers.

   4. BCNF, 3NF. BCNF decomposition, 3NF synthesis.

2. Triggers:
   1. General form.

   2. Consideration, execution, granularity.

   3. Multiple enabled triggers.

   4. Controlling cascading triggers. (Hand-off discussion to cascading triggers expert, John T.)

   5. PL/pgSQL.

3. Physical disk organization:
   1. CHS addressing and components of access time.

4. Data storage structures:
   1. Heap structure.

   2. Sorted structure.

   3. Indexing schemes: clustered/unclustered, sparse/dense, search keys with multiple attributes, multi-level indices (ISAM, trees).

   4. Efficiency analysis.

5. Query processing:
   1. External sorts, projections, unions, differences.

   2. Select.

   3. Join.

   4. Access paths and efficiency analysis.

6. Transactions:
   1. Isolation.

   2. Atomicity.

   3. Durability.

   4. Distributed transactions.