Survey
* Your assessment is very important for improving the work of artificial intelligence, which forms the content of this project
Download cos346day10
Document related concepts
no text concepts found
Transcript
COS 346 Day 10 DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-1 Agenda • Assignment 3 is NOT Corrected • Assignment 4 Posted is Not corrected • Quiz 1 Mar 2 (note change!) – – – – – – DP Chap 1-6, SQL Chap 1 & 2 15 M/C @ 4 points each, 5 Short essays @ 8 points each. 60 min Available from 2-5 PM Password will appear in an announcement • Capstone Proposals OVERDue – Must be a database related capstone – Capstone Project Description sp 09.htm – Received 5 …5 require modification..1 rejected… 2 MIA • Discussion on Transforming Data Models into Database Designs DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-2 Recursive Relationships: 1:1 Recursive Relationships As a data model DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall As a table 6-3 Recursive Relationships: 1:N Recursive Relationships As a data model DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall As a table 6-4 Recursive Relationships: N:M Recursive Relationships As a data model DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall As a set of tables 6-5 Representing Ternary and HigherOrder Relationships • Ternary and higher-order relationships may be constrained by the binary relationship that comprise them: – MUST constraint - Requires that one entity must be combined with another entity in the ternary (or higherorder) relationship – MUST NOT constraint - Requires that certain combinations of two entities are not allowed to occur in the ternary (or higher-order) relationship – MUST COVER constraint – A binary relationship specifies all combinations of two entities that must appear in the ternary (or higher-order) relationship DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 6-6 MUST Constraint DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 6-7 MUST NOT Constraint DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 6-8 MUST COVER Constraint DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 6-9 HighLine University DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 6-10 HighLine University HighLine University DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 6-11 Design for Minimum Cardinality • 4 possibilities – O-O • FK = null allowed • Do nothing! – O-M – M-O – M-M DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 6-12 When Parent = M DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 6-13 When Child = M DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 6-14 Actions to apply DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 6-15 Minimum Cardinality M-M DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 6-16 Minimum Cardinality DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 6-17 View Ridge DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 6-18 View Ridge DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 6-19 View Ridge DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 6-20 View Ridge DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 6-21 David M. Kroenke’s Database Processing Fundamentals, Design, and Implementation (10th Edition) End of Presentation: Chapter Six Part Two DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 6-22
Related documents