1Final ReviewFriday, December 8, 20062The Final• Date: Monday, December 11• Time: 8:30 – 10:20• Place: this room• Open book exam3Problem 1• Data modeling• Relational model• SQL,• XML4Data Modeling• E/R diagrams• Keys• Relationships• Inheritance• Mapping to relations5Relational Model• Relations• Keys• Functional dependencies• Decomposition• Normal forms6SQL• Select-from-where• Subqueries• Aggregation• Nulls• Outer joins7SQL (continued)• Database modification• Defining and modifying relation schemas• Constraints– On attribute values– Keys– Foreign keys8XML• Xquery/Xpath• XML syntax• DTD• From relations to XML• From XML to relations9Problem 2: Transactions• ACID properties• Recovery• Concurrency10Recovery• Undo log• Redo log• Undo/redo log11Concurrency control• Serializability• Conflict serializability• Locks• Timestamps• Validation12Problem 3: Operators• Indexes• Physical operators13Index Structures• Terminology:– Dense/sparse index– Primary/secondary index• B+-trees14Physical Operators• One-pass algorithms• Nested-loop joins• Two-pass algorithms based on sorting• Two-pass algorithms based on hash tables• Index-based algorithms15Problem 4: Optimizations• Algebra– Check that you know how to convert from SQL• Algebraic laws– Which of these expressions are equal ? What if we have keys/foreign keys ?• Dynamic programming• Pipelining• You should be able to discuss alternative choices of query plans16General Advice• Some problems will require thinking– Use judgment• Problem difficulty may be uneven:– do the easy ones first17Grading–Homework 30%–Project: 25%–Midterm: 15%–Final: 25%–Intangibles: 5%18COMMIT(The
View Full Document
Unlocking...