1. 1 Review #1 l Intro stuff –What is a database, 4 parts, 3 users, etc. l Architecture –Data independence –Three levels, two mappings –Jobs of the DBA

2. 2 Review #1 l Entity Relationship Model –Entities, Relationships, E-R Diagram –Relationship types –Conversion to a set of tables. –GRADUATE STUDENTS: Extended ER Features, such as multivalued attributes, total participation, cardinality limits, etc. l Relational Model (Informal) –Primary and Foreign Keys –Ability to add additional constraints

3. 3 Review #1 l ORACLE/SQL: –Creating tables –Inserting, deleting, updating (Lab 1) –Querying Simple queriesSimple queries JoinsJoins Non-Relational Queries – Group By, etc.Non-Relational Queries – Group By, etc. (Lab 2)(Lab 2) l Something from the text.

4. 4 Sample Question: l (5 pts) What is a database?

5. 5 Sample (Bad) Answer #1: l (5 pts) What is a database? –A set of tables.

6. 6 Sample (Bad) Answer #2: l (5 pts) What is a database? –A database is a collection of related data. A Relational Database is one that stores this data in a set of tables. Example 1: A banks stores customer information, their accounts and transactions. Example 2: A university stores information about its students, courses, and registration information. Databases consist of data, hardware, software, and end users. The data is called persistent data; the software is called the DataBase Management System. There are 3 types of users: end users, application programmers, and database administrators.

7. 7 Sample (Bad) Answer #2 (cont): l A database is designed in 3 levels: internal, conceptual, and external. To do the conceptual level design, we use the Entity Relationship Model. This requires us to decide upon our entities, relationships, draw an E-R Diagram, decide on the type of relationships, and then develop a set of tables from this completed diagram. There are 3 types of relationships: 1 to1, 1 to many, and many to many. The external level is what the individual users are permitted to see; the internal level consists of the file structures, which are B-Trees, Clustered B-Trees, Hashing, and Clustered Files.

8. 8 Sample (Good) Answer #3: l (5 pts) What is a database? l Informally, a database is a collection of related data. The most common model is the Relational model, which groups the data into tables with linkages (known as Foreign Keys) to model the relationships.

9. 9 Review #2 l Relational Model –Definitions –Properties of relations –Keys -- Candidate, Primary, Alternate, Foreign –Integrity Constraints. l Relational Algebra –Definitions –English  Relational Algebra  Tables –Optimization l Relational Calculus –Definitions –English  Relational Calculus  Tables

10. 10 Review #2 l Internal Level design/ External Level design –File Structures and Analysis –GRADUATE STUDENTS: Advanced File Structures l GRADUATE STUDENTS: Extended Relational Algebra –English Extended RA l ORACLE/SQL –Views (need to review Querying for this) –Privileges –Indexes –Advanced CREATE TABLE options –LAB 3

11. 11 Final Review (updated for Fall 2014) l Intro Stuff l Architecture –Three levels, two mappings –File Structures – What and when to use l E-R Model Design l Relational Model –Keys, Integrity constraints, etc. l Query Optimization Using Relational Algebra. l Relational Algebra or Relational Calculus Queries –GRADUATE STUDENTS – Know BOTH.

12. 12 Final Review 2 l GRADUATE STUDENTS: –Extended Relational Algebra l Conversion from RC to RA (not on final) l Functional Dependencies –Definitions, Axioms –Spot them –Proof of Candidate Keys –Graduate Students: Proof of Minimality l Normal Forms, 1NF –Definition –Spot violations –Normalization

13. 13 Final Review 3 l Normal Forms, 2NF, 3NF, BCNF –Definitions -- Formal and Informal –Spot violations –Normalization through decomposition l Multi-Value Dependencies –Definitions, Axioms –Find them, using quick & dirty method and t1, t2, t3 method. l 4NF –Definition, find violations, normalization l GRADUATE STUDENTS: –Join dependencies and 5NF

14. 14 Final Review 4 l Hierarchical Model – Not on FINAL –Definition, Advantages, Disadvantages –Type, Occurrence Trees, Virtual Links –Design l Transaction Analysis –Locks, Commit & Rollback –Buffers, Checkpoints, Transaction Logs –Recovery Algorithm l Oracle/SQL –Labs 1, 2, 3 –Lab 4 – Code SEGMENT only