1. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-1 David M. Kroenke Database Processing Tenth Edition Chapter 5 Data Modeling ER Model

2. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-2 Database Development Approaches Top-down development Prototype Bottom-up development

3. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-3 Top-down Development General requirements to specific requirements A global perspective

4. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-4 Systems Development Life Cycle Project Identification and Selection Project Initiation and Planning Analysis Physical Design Implementation Maintenance Logical Design

5. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-5 Database Development Activities During SDLC 1.Project Id/Selection 2.Initiation/Planning 3.Analysis 4.Logical Design 5.Physical Design 6.Implementation 7.Maintenance 1.Enterprise Data Modeling 2.Conceptual Data Modeling 3.Logical DB Design 4.Physical DB Design 5.DB Implementation 6.Maintenance

6. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-6 1. Project ID/Selection Enterprise Modeling Analyze current DP Justify need for new DB

7. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-7 2-3. Project Initiation/Planning & Analysis Conceptual Data Modeling ID scope of DB requirements Analyze overall data requirements Develop preliminary data model

8. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-8 4. Logical Design Logical Database Design Detail transactions, applications, views etc required by DB system ID security, backup, concurrency issues Create stable, well-defined structure (normalization)

9. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-9 5. Physical Design Physical Database Design Define DB to DBMS Develop DB applications

10. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-10 6. Implementation Physical Implementation Load data Install & test DB applications Complete documentation & training

11. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-11 7. Maintenance DB Maintenance Ensure DB meeting needs/reqs Performance tuning Backup/Recovery

12. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-12 Prototype Development Develop portions of the database and submit to users for feedback, refinement, and enhancement

13. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-13 ID Problem Develop Prototype Implement Prototype Revise Prototype Prototype Development Convert to Production Prototype Development

14. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-14 Bottom-up Development Specific requirements to general requirements Typically faster and less risky

15. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-15 Data Modeling Creation Interviewing users Documenting requirements Building a data model Building a database prototype A process of inference –Working backwards

16. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-16 The Data Model A data model is a plan, or blueprint, for a database design. A data model defines and graphically depicts the data structure and relationships among the data A data model is more generalized and abstract than a database design.

17. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-17 E-R Model Entity-Relationship model is a set of concepts and graphical symbols that can be used to create conceptual schemas. Versions –Original E-R model — Peter Chen (1976). –Extended E-R model — Extensions to the Chen model. –Information Engineering (IE) — James Martin (1990); it uses “crow’s foot” notation, is easier to understand and we will use it. –IDEF1X — A national standard developed by the National Institute of Standards and Technology [see Appendix B] –Unified Modeling Language (UML) — The Object Management Group; it supports object-oriented methodology [see Appendix C]

18. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-18 Entities Something that can be identified and the users want to track –Entity class — a collection of entities of a given type –Entity instance — the occurence of a particular entity There are usually many instances of an entity in an entity class.

19. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-19 CUSTOMER: The Entity Class and Two Entity Instances

20. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-20 Attributes Attributes describe an entity’s characteristics. All entity instances of a given entity class have the same attributes, but vary in the values of those attributes. Originally shown in data models as ellipses. Data modeling products today commonly show attributes in rectangular form.

21. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-21 EMPLOYEE: Attributes in Ellipses

22. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-22 EMPLOYEE: Attributes in Entity Rectangle

23. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-23 Identifiers Identifiers are attributes that name, or identify, entity instances. The identifier of an entity instance consists of one or more of the entity’s attributes. Composite identifiers: Identifiers that consist of two or more attributes Identifiers in data models become keys in database designs: –Entities have identifiers. –Tables (or relations) have keys.

24. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-24 Entity Attribute Display in Data Models

25. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-25 Relationships Entities can be associated with one another in relationships: –Relationship classes: associations among entity classes –Relationship instances: associations among entity instances In the original E-R model, relationships could have attributes but today this is no longer done. –Really an issue of semantics A relationship class can involve two or more entity classes.

26. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-26 Degree of the Relationship The degree of the relationship is the number of entity classes in the relationship: –Two entities have a binary relationship of degree two. –Three entities have a ternary relationship of degree three.

27. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-27 Binary Relationship

28. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-28 Ternary Relationship

29. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-29 Entities and Tables The principle difference between an entity and a table (relation) is that you can express a relationship between entities without using foreign keys. This makes it easier to work with entities in the early design process where the very existence of entities and the relationships between them is uncertain.

30. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-30 Cardinality Cardinality means “count,” and is expressed as a number. Maximum cardinality is the maximum number of entity instances that can participate in a relationship. Minimum cardinality is the minimum number of entity instances that must participate in a relationship.

31. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-31 Maximum Cardinality Maximum cardinality is the maximum number of entity instances that can participate in a relationship. There are three types of maximum cardinality: –One-to-One [1:1] –One-to-Many [1:N] –Many-to-Many [N:M]

32. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-32 The Three Types of Maximum Cardinality

33. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-33 Parent and Child Entities In a one-to-many relationship: –The entity on the one side of the relationship is called the parent entity or just the parent. –The entity on the many side of the relationship is called the child entity or just the child. In the figure below, EMPLOYEE is the parent and COMPUTER is the child:

34. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-34 HAS-A Relationships The relationships we have been discussing are known as HAS-A relationships: –Each entity instance has a relationship with another entity instance: An EMPLOYEE has one or more COMPUTERs. A COMPUTER has an assigned EMPLOYEE.

35. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-35 Minimum Cardinality Minimum cardinality is the minimum number of entity instances that must participate in a relationship. Minimums are generally stated as either zero or one: –IF zero [0] THEN participation in the relationship by the entity is optional, and no entity instance must participate in the relationship. –IF one [1] THEN participation in the relationship by the entity is mandatory, and at least one entity instance must participate in the relationship.

36. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-36 Indicating Minimum Cardinality As shown in the examples in a following slide: –Minimum cardinality of zero [0] indicating optional participation is indicated by placing an oval next to the optional entity. –Minimum cardinality of one [1] indicating mandatory (required) participation is indicated by placing a vertical hash mark next to the required entity.

37. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-37 Reading Minimum Cardinality Look toward the entity in question: –IF you see an oval THEN that entity is optional (minimum cardinality of zero [0]). –IF you see a vertical hash mark THEN that entity is mandatory (required) (minimum cardinality of one [1]).

38. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-38 The Three Types of Minimum Cardinality

39. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-39 ID-Dependent Entities An ID-dependent entity is an entity (child) whose identifier includes the identifier of another entity (parent). The ID-dependent entity is a logical extension or sub-unit of the parent: –BUILDING : APARTMENT –PAINTING : PRINT The minimum cardinality from the ID-dependent entity to the parent is always one.

40. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-40 ID-Dependent Entities A solid line indicates an identifying relationship

41. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-41 Weak Entities A weak entity is an entity whose existence depends upon another entity. All ID-Dependent entities are considered weak. Weak entities not necessarily ID- Dependent. –The identifier of the parent does not appear in the identifier of the weak child entity.

42. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-42 Weak Entities (Continued) A dashed line indicates a nonidentifying relationship Weak entities must be indicated by an accompanying text box in Erwin – There is no specific notation for a nonidentifying but weak entity relationship

43. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-43 Subtype Entities A subtype entity is a special case of a supertype entity: –STUDENT : UNDERGRADUATE or GRADUATE The supertype contains all common attributes, while the subtypes contain specific attributes. The supertype may have a discriminator attribute that indicates the subtype.

44. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-44 Subtypes with a Discriminator

45. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-45 Subtypes: Exclusive or Inclusive If subtypes are exclusive, one supertype relates to at most one subtype. If subtypes are inclusive, one supertype can relate to one or more subtypes.

46. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-46 Subtypes: Exclusive or Inclusive (Continued)

47. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-47 Subtypes: IS-A relationships Relationships connecting supertypes and subtypes are called IS-A relationships, because a subtype IS A supertype. The identifier of the supertype and all of its subtypes must be identical, i.e., the identifier of the supertype becomes the identifier of the related subtype(s). Subtypes are used to avoid value- inappropriate nulls.

48. DAVID M. KROENKE’S DATABASE PROCESSING, 10th Edition © 2006 Pearson Prentice Hall 5-48 Unified Modeling Language (UML) The Unified Modeling Language is a set of structures and techniques for modeling and designing object-oriented programs (OOP). A primary difference between UML and E-R diagrams is that UML includes information about object constraints and methods. Conversion between E-R and UML – Figure C-1(b) in Appendix C has a mistake