1 / 19

Lecture 30: Final Review

Lecture 30: Final Review. Wednesday, December 10, 2003. The Final. Date: Friday, December 12 Time: 8:30 – 10:20 Place: this room Open book exam !. Problem 1. Data modeling/relational model. Data Modeling. E/R diagrams, ODL Keys Relationships Inheritance Mapping to relations.

bettyandrews
Télécharger la présentation

Lecture 30: 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 30: Final Review Wednesday, December 10, 2003

  2. The Final • Date: Friday, December 12 • Time: 8:30 – 10:20 • Place: this room • Open book exam !

  3. Problem 1 • Data modeling/relational model

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

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

  6. Problem 2 • SQL

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

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

  9. Problem 3 • XML

  10. XML • XML syntax • DTD • From relations to XML • From XML to relations

  11. Data Storage • The I/O model of computation • Representing data elements: • Grouping records into blocks • Variable length records • Overflow blocks

  12. Problem 4 • Database implementation

  13. Index Structures • Terminology: • Dense/sparse index • Primary/secondary index • B+-trees • Hash tables

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

  15. Optimizations • Extended logical operators • Algebraic identities • Heuristic based optimization: • Cost based optimization: • Size estimation • Dynamic programming for join order

  16. Recovery • Undo logging • Redo logging • Undo/redo logging

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

  18. Grading –Homework 25% best 3 out of 4 –Project: 30% –Midterm: 15%: may be overridden by final –Final: 25% –Intangibles: 5%

  19. The End

More Related