1 / 18

Lecture 24: Final Review

Lecture 24: Final Review. Friday, March 10, 2006. The Final. Date: Wednesday, March 15, 2006 Time: 2:30-4:20 Place: this room Open book exam. Problem 1. Data modeling/relational model/SQL. Data Modeling. E/R diagrams Keys Relationships Inheritance Mapping to relations.

comacho
Télécharger la présentation

Lecture 24: Final Review

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lecture 24: Final Review Friday, March 10, 2006

  2. The Final • Date: Wednesday, March 15, 2006 • Time: 2:30-4:20 • Place: this room • Open book exam

  3. Problem 1 • Data modeling/relational model/SQL

  4. Data Modeling • E/R diagrams • Keys • Relationships • Inheritance • Mapping to relations

  5. Relational Model • Relations • Keys • Functional dependencies • Decomposition • Normal forms

  6. SQL • Select-from-where • Subqueries • Aggregation • Nulls • Outer joins

  7. SQL (continued) • Database modification • Defining and modifying relation schemas • Constraints • On attribute values • Keys • Foreign keys

  8. Problem 2: XML • Xquery/Xpath • XML syntax • DTD • From relations to XML • From XML to relations

  9. XQuery • Selecting data from XML (often in Xpath) • Constructing new XML values (RETURN) • Aggregates • Duplicate elimination (!!)

  10. Problem 3: Transactions • ACID properties • Recovery • Concurrency

  11. Recovery • Undo log • Redo log • Undo/redo log • This was already on the midterm, so will likely be a small question or none

  12. Concurrency control • Serializability • Conflict serializability • Locks • Timestamps • Validation

  13. Problem 4: Database Implementation • Indexes • Physical operators • Optimizations • Size estimation

  14. Index Structures • Terminology: • Dense/sparse index • Primary/secondary index • B+-trees • Hash tables • Basic hash tables • Extensible hash table

  15. Physical Operators • One-pass algorithms • Nested-loop joins • Two-pass algorithms based on sorting • Two-pass algorithms based on hash tables • Index-based algorithms

  16. General Advice • Some problems will require thinking • Use judgment • Problem difficulty may be uneven: • do the easy ones first

  17. Grading –Homework 25% –Project: 30% –Midterm: 15% –Final: 25% –Intangibles: 5%

  18. COMMIT(The End)

More Related