1. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-1 COS 346 Day 7

2. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-2 Agenda Assignment Two is Due Assignment 3 Posted Due next Monday Feb 16 Assignment 4 will be posted later this week and will be due Feb 23 Quiz 1  Mar 2 (note change!) –DP Chap 1-6, SQL Chap 1 & 2 Capstone Proposals Due next Monday, Feb 16 –Must be a database related capstone –Capstone Project Description sp 09.htmCapstone Project Description sp 09.htm Continue Discussion on Data Modeling with the Entity- Relationship Model

3. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-3 David M. Kroenke’s Chapter Five: Data Modeling with the Entity-Relationship Model Part Two Database Processing: Fundamentals, Design, and Implementation

4. Creating models Indentify entities –Attributes –Functional dependencies –Keys Indentify relationships between entities –Indentifying or non identifying Id-dependant? –Strong or weak –Subtype Indentify Max cardinalities Identify Min cardinalities DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-4

5. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-5 Strong Entity Patterns: 1:1 Strong Entity Relationships

6. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-6 Strong Entity Patterns: 1:1 Strong Entity Relationships

7. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-7 Strong Entity Patterns: 1:N Strong Entity Relationships

8. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-8 Strong Entity Patterns: 1:N Strong Entity Relationships

9. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-9 Strong Entity Patterns: N:M Strong Entity Relationships

10. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-10 Strong Entity Patterns: N:M Strong Entity Relationships

11. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-11 Strong Entity Patterns: N:M Strong Entity Relationships

12. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-12 ID-Dependent Relationships: The Association Pattern Note the Price column, which has been added.

13. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-13 ID-Dependent Relationships: The Association Pattern

14. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-14 ID-Dependent Relationships: The Multivalued Attribute Pattern

15. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-15 ID-Dependent Relationships: The Multivalued Attribute Pattern

16. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-16 ID-Dependent Relationships: The Multivalued Attribute Pattern

17. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-17 ID-Dependent Relationships: The Multivaled Attribute Pattern

18. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-18 ID-Dependent Relationships: The Archtype/Instance Pattern The archtype/instance pattern occurs when the ID-dependent child entity is the physical manisfestation (instance) of an abstract or logical parent: –PAINTING : PRINT –CLASS : SECTION –YACHT_DESIGN : YACHT –HOUSE_MODEL: HOUSE

19. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-19 ID-Dependent Relationships: The Archtype/Instance Pattern Note that these are true ID-dependent relationships - the identifier of the parent appears as part of the composite identifier of the ID- dependent child.

20. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-20 ID-Dependent Relationships: The Archtype/Instance Pattern Note the use of weak, but not ID- dependent children.

21. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-21 David M. Kroenke’s Database Processing Fundamentals, Design, and Implementation (10 th Edition) End of Presentation: Chapter Five Part Two

22. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-22 David M. Kroenke’s Chapter Five: Data Modeling with the Entity-Relationship Model Part Three Database Processing: Fundamentals, Design, and Implementation

23. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-23 Mixed Patterns: The Line-Item Pattern

24. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-24 Mixed Patterns: The Line-Item Pattern

25. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-25 Mixed Patterns: Other Mixed Patterns Look for a mixed pattern where: –A strong entity has a multivalued composite group, and –One of the elements of the composite group is an identifier of another strong entity

26. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-26 Mixed Patterns: Other Mixed Patterns

27. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-27 Mixed Patterns: Other Mixed Patterns

28. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-28 Mixed Patterns: The For-Use-By Pattern

29. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-29 Mixed Patterns: The For-Use-By Pattern

30. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-30 Recursive Relationships A recursive relationship occurs when an entity has a relationship to itself

31. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-31 Recursive Patterns: 1:1 Recursive Relationship

32. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-32 Recursive Patterns: 1:N Recursive Relationship

33. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-33 Recursive Patterns: N:M Recursive Relationship

34. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-34 David M. Kroenke’s Database Processing Fundamentals, Design, and Implementation (10 th Edition) End of Presentation: Chapter Five Part Three

35. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-35 David M. Kroenke’s Chapter Five: Data Modeling with the Entity-Relationship Model Part Four Database Processing: Fundamentals, Design, and Implementation

36. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-36 Highline University The Highline University [HU] database will track such entities as: –Colleges –Departments –Faculty –Students We have gathered a set of HU reports that will be the source documents for a data model

37. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-37 The College Report

38. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-38 Data Model from the College Report This is a weak, but not ID-dependent, 1:N relationship You cannot access the slides from computers outside the UMS network (ip 130.11.x.x). I had to limit the access due to copyright on the materials. It is a legal issue and not a technical issue. Sorry, my hands are tied. I may be allowed to provide access to your individual computer if you supply me your IP address.

39. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-39 The Department Report

40. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-40 The DEPARTMENT / PROFESSOR Relatioship: Alternate Model 1: Using an N:M Relationship This is an N:M relationship

41. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-41 The DEPARTMENT / PROFESSOR Relatioship: Alternate Model 2: Using a 1:N Relationship This is a 1:N relationship

42. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-42 The DEPARTMENT / PROFESSOR Relatioship: Alternate Model 3: Using an Association Pattern This is an association pattern

43. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-43 The DEPARTMENT / PROFESSOR Relatioship: Alternate Model 4: Using a Association Pattern and a 1:N Relationship This is an association pattern This is a 1:1 relationship

44. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-44 The Department Major Report

45. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-45 Data Model with STUDENT Entity

46. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-46 The Student Acceptance Letter

47. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-47 Data Model with Advises Relationship

48. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-48 Final Highline University Data Model

49. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-49 Visio Version

50. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-50 David M. Kroenke’s Database Processing Fundamentals, Design, and Implementation (10 th Edition) End of Presentation: Chapter Five Part Four