1 / 18

COP4710 Database Systems

COP4710 Database Systems. Final Review. Fall 2013. Final Exam. Time : Thursday 12/12/2012 3pm --- 5pm Venue : HCB 315, in-class exam Closed book/note, but you can bring a piece of cheat sheet (A4, double side) Plan your strategy well No calculators or other electronic devices

kasia
Télécharger la présentation

COP4710 Database Systems

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. COP4710Database Systems Final Review Fall 2013

  2. Final Exam • Time: Thursday 12/12/2012 3pm --- 5pm • Venue: HCB 315, in-class exam • Closed book/note, but you can bring a piece of cheat sheet (A4, double side) • Plan your strategy well • No calculators or other electronic devices • Laptops, IPADs, smart phones, etc. are prohibited • Any form of cheating on the examination will result in zero grade, and will be reported to the university

  3. Final Exam • Bring you FSU ID to attend the final exam • Final week office hour • 12/11, Wednesday: 9:30am – 11:30am • 35% of your final score • Coverage • Accumulative, all materials taught in the class and on the textbook

  4. Format • One set of true/false questions with brief answer • Any relation in 3NF is in BCNF as well • Answer: False. Because …… • Short-answer questions • What is undo logging? How to use undo logging for crash recovery? • Several more questions • 100 points • I believe you should have enough time (120 minutes)

  5. Suggested Method for Study • Go over the lecture slides and study the textbook • Work independently on problems in HW/lectures/exercises in the textbook • Questions? Office hours (me and TA) • Discuss with people in the class • Any practice– work it out before looking at solutions

  6. DB: What and Why? • Besides file systems and OS, why bother yet another so-called DB? • William C. McGee: Generalization: Key to Successful Electronic Data Processing. J. ACM 6(1): 1-23 (1959) • When data processing was mostly ad-hoc programs– Need generalization, e.g., • Sorting • File maintenance • Report generation

  7. User/Web Forms/Applications/DBA query transaction DDL commands Query Parser Transaction Manager DDL Processor Query Rewriter Concurrency Control Logging & Recovery Query Optimizer Query Executor Records Indexes Lock Tables Buffer: data, indexes, log, etc Buffer Manager Main Memory Storage Manager Storage data, metadata, indexes, log, etc What Has Resulted-- DBMS Architecture

  8. Results are Impressive

  9. Why Such Great Achievements?

  10. And Many More Behind the Scene • The next one is You!

  11. ER Model • Entities • Attributes • Relationships • Key constraints: many-one, many-many • Participation constraints • Roles • Subclasses • Constraints • Keys, referential integrity • Weak Entity Set: Why & How? • Question: Given a real world application, model it into an ER model

  12. Relational Model • Schema and instances • DDL and DML • Primary key, Foreign key, Unique, NULL, Default • Translating ER to Relations • Entities • Relationships (many-many, many-one, one-one) • Weak entity set • Subclass • Question: Given an ER diagram, translate it into a set of relations (primary, foreign keys; SQL)

  13. Relational Algebra • Operators and operands • Set-based operators • Other basic operators • Derived operators • Cartesian product, theta-join, equi-join, natural join • Relational algebra expressions and expression trees • Question: Given a database, answer queries using relational algebra

  14. Relational Design • Motivation • Functional dependencies & keys • Armstrong axioms • Closures • Normal forms and decomposition algorithms • BCNF • Lossless or lossy? • 3NF • Functional-dependency preserving or not? • Don’t overdo it • Question: Given a relation and a set of functional dependencies, decompose it into BCNF or 3NF

  15. SQL • What is SQL? • Why SQL? • DDL & DML in SQL • Select-From-Where • String pattern matching • 3-value logic • Sub-queries • Aggregate queries • Select-From-Where-Group-by-Having • Constraints • Keys, checks, assertions, triggers • Question: given a database, answer queries using SQL

  16. Indexing • Indexing Basics • Clustered/unclustered index • Dense/sparse index • Primary/secondary index • Sequential index • B/B+ Trees • Definition • Insertion/Deletion • Hashing • Extensible hashing • Linear hashing • Question: Given a B+ tree/hash index, insert/delete a series of (key, records)

  17. Transactions Management and Crash Recovery • What are transactions? • Properties of transactions: ACID • Conflicts in transaction management • Protocols for concurrency control • Crash recovery • Undo logging (with checkpoint) • Redo logging (with checkpoint) • Undo redo logging • Question: Given an undo/redo log file, try to recover from crashes

  18. Break a Leg! Hopefully see you at COP5725 (Advanced DB) in Spring 2014!

More Related