1 / 68

Entity-Relationship Model

Entity-Relationship Model. Lecture 5. Database Modeling and Implementation Process. Ideas . ER Design . Relational Schema. Relational DBMS Implementation. Database Modeling – ER Approach. A database can be modeled as a collection of entities, relationship among entities.

ronni
Télécharger la présentation

Entity-Relationship Model

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. Entity-Relationship Model Lecture 5

  2. Database Modeling and Implementation Process Ideas ER Design Relational Schema Relational DBMS Implementation

  3. Database Modeling – ER Approach • A database can be modeled as • a collection of entities, • relationship among entities. • An entityis an object that exists and is distinguishable from other objects. • Example: specific person, company, event, plant • Entities have attributes • Example: people have names and addresses • An entity set is a set of entities of the same type that share the same properties. • Example: set of all persons, companies, trees, holidays

  4. ER Model Components • Entity Sets • Relationships • Attributes

  5. Entity Sets instructor and student instructor_ID instructor_name student-ID student_name

  6. Relationship Sets • A relationship is an association among several entities Example: 44553 (Peltier)advisor 22222 (Einstein)student entity relationship set instructor entity • A relationship set is a mathematical relation among n 2 entities, each taken from entity sets {(e1, e2, … en) | e1  E1, e2  E2, …, en  En}where (e1, e2, …, en) is a relationship • Example: (44553,22222)  advisor

  7. Relationship Set advisor

  8. Relationship Sets (Cont.) • An attribute can also be property of a relationship set. • For instance, the advisor relationship set between entity sets instructor and student may have the attribute date which tracks when the student started being associated with the advisor

  9. Relationship Set borrower

  10. Relationship Sets • An attribute can also be property of a relationship set.

  11. Degree of a Relationship Set • Refers to number of entity sets that participate in a relationship set. • Relationship sets that involve two entity sets are binary (or degree two). Generally, most relationship sets in a database system are binary. • Relationship sets may involve more than two entity sets. .

  12. Degree of a Relationship Set • Relationships between more than two entity sets • Example: students work on research projects under the guidance of an instructor. • relationship proj_guide is a ternary relationship between instructor, student, and project

  13. Attributes • An entity is represented by a set of attributes, that is descriptive properties possessed by all members of an entity set. • Example: instructor = (ID, name, street, city, salary ) course= (course_id, title, credits) • Domain – the set of permitted values for each attribute • Attribute types: • Simple and composite attributes. • Single-valued and multivalued attributes • Example: multivalued attribute: phone_numbers • Derived attributes • Can be computed from other attributes • Example: age, given date_of_birth

  14. Attributes • An entity is represented by a set of attributes, that is descriptive properties possessed by all members of an entity set. • Domain – the set of permitted values for each attribute • Attribute types: • Simple and composite attributes. • Single-valued and multi-valued attributes • Derived attributes • Can be computed from other attributes student = (student-id, student-name, student-street, student-city)

  15. Composite Attributes MultiValued Attributes: Attribute that has more than one value: set of telephone numbers set of addresses in : 1 Person 2 Name 2 telephone# 2 address

  16. Derived Attributes Attribute whose value is derived from other attributes 1 Person 2 Name 2 telephone# 2 address 2 DOB 2 Age derived from DOB and current date

  17. ER Diagrams - Symbols

  18. Summary of Symbols

  19. Mapping Cardinality Constraints • Express the number of entities to which another entity can be associated via a relationship set. • Most useful in describing binary relationship sets. • For a binary relationship set the mapping cardinality must be one of the following types: • One to one • One to many • Many to one • Many to many

  20. Types of Binary Relationships Representation of Many-One Many-one Many-many One-one • Many-one E/R: arrow pointing to “one.”

  21. One-To-One Relationships Best-seller Put arrows in both directions. Rectangles represent entity set and diamonds represent relationship set.  Represent one Manfs that corresponds to  one Beers Manfs Beers

  22. One-To-ManyRelationship • In the one-to-many relationship a loan is associated with at most one customer via borrower, a customer is associated with several (including 0) loans via borrower

  23. Many-To-One Relationships • In a many-to-one relationship a loan is associated with several (including 0) customers via borrower, a customer is associated with at most one loan via borrower

  24. Participation of an Entity Set in a Relationship Set • Totalparticipation (indicated by double line): every entity in the entity set participates in at least one relationship in the relationship set • E.g. participation of loan in borrower is total • every loan must have a customer associated to it via borrower • Partial participation: some entities may not participate in any relationship in the relationship set • E.g. participation of customer in borrower is partial

  25. Many-To-Many Relationship • A customer is associated with several (possibly 0) loans via borrower • A loan is associated with several (possibly 0) customers via borrower

  26. Keys • A super key of an entity set is a set of one or more attributes whose values uniquely determine each entity. • A candidate key of an entity set is a minimal super key • ID is candidate key of instructor • course_id is candidate key of course • Although several candidate keys may exist, one of the candidate keys is selected to be the primary key.

  27. Keys for Relationship Sets • The combination of primary keys of the participating entity sets forms a super key of a relationship set. • (s_id, i_id) is the super key of advisor • NOTE: this means a pair of entity sets can have at most one relationship in a particular relationship set. • Example: if we wish to track multiple meeting dates between a student and her advisor, we cannot assume a relationship for each meeting. We can use a multivalued attribute though • Must consider the mapping cardinality of the relationship set when deciding what are the candidate keys • Need to consider semantics of relationship set in selecting the primary key in case of more than one candidate key

  28. Redundant Attributes • Suppose we have entity sets • instructor, with attributes including dname • department and a relationship • inst_dept relating instructor and department • Attribute dname in entity instructor is redundant since there is an explicit relationship inst_dept which relates instructors to departments • The attribute replicates information present in the relationship, and should be removed from instructor

  29. E-R Diagrams

  30. Entity With Composite, Multivalued, and Derived Attributes

  31. Relationship Sets with Attributes

  32. Cardinality Constraints on Ternary Relationship • We allow at most one arrow out of a ternary (or greater degree) relationship to indicate a cardinality constraint • E.g., an arrow from proj_guide to instructor indicates each student has at most one guide for a project • If there is more than one arrow, there are two ways of defining the meaning. • E.g., a ternary relationship R between A, B and C with arrows to B and C could mean 1. each A entity is associated with a unique entity from B and C or 2. each pair of entities from (A, B) is associated with a unique C entity, and each pair (A, C) is associated with a unique B • Each alternative has been used in different formalisms • To avoid confusion we outlaw more than one arrow

  33. Beers-Bars-Drinkers Example • Our running example. name addr license Frequents Serves Bars Likes Beers Drinkers name manf name addr

  34. Courses Enrolls Students Students Courses TAs Ann CS43005 Jan Sue CS43005 Pat Bob CS43005 Jan … … … Instructors

  35. Example:Drinkers Have Favorite Beers name addr license Frequents Serves Bars Likes Beers Drinkers Favorite name manf name addr

  36. Attributes on Relationships price Sells • Shorthand for 3-way relationship: Bars Beers price Prices Sells Bars Beers

  37. A true 3-way relationship. • Price depends jointly on beer and bar. • Notice arrow convention for multiway relationships: “all other E.S. determine one of these.” • Not sufficiently general to express any possibility. • However, if price, say, depended only on the beer, then we could use two 2-way relationships: price-beer and beer-bar. • Or better: just make price an attribute of beer.

  38. Converting Multiway to 2-Way • Create a new connecting E.S. to represent rows of a relationship set. • E.g., (Joe's Bar, Bud, $2.50) for the Sells relationship. • Many-one relationships from the connecting E.S. to the others. BBP The-Bar The-Beer The-Price Bars Beers Price

  39. Converting Multiway to 2-Way Stars Contract Movies Studio_Producer Studio_star Studios

  40. Converting Multiway to 2-Way Stars Movies movie_of Star-_of Contracts Studio Producer Studio_star Studios

  41. Roles • Entity sets of a relationship need not be distinct • The labels “manager” and “worker” are called roles; they specify how employee entities interact via the works-for relationship set. • Roles are indicated in E-R diagrams by labeling the lines that connect diamonds to rectangles. • Role labels are optional, and are used to clarify semantics of the relationship

  42. Specialization • within an entity set that are distinctive from other entities in the set. • These subgroupings become lower-level entity sets that have attributes or participate in relationships that do not apply to the higher-level entity set. • Depicted by a triangle component labeled ISA (E.g. Top-down design process; we designate subgroupings customer “is a” person). • Attribute inheritance – a lower-level entity set inherits all the attributes and relationship participation of the higher-level entity set to which it is linked.

  43. Specialization Example

  44. loan-payment loan payment Existence Dependencies • If the existence of entity x depends on the existence of entity y, then x is said to be existence dependent on y. • y is a dominant entity (in example below, loan) • x is a subordinate entity (in example below, payment) If a loan entity is deleted, then all its associated payment entities must be deleted also.

  45. Weak Entity Sets • An entity set that does not have a primary key is referred to as a weak entity set. • The existence of a weak entity set depends on the existence of a identifying entityset • it must relate to the identifying entity set via a total, one-to-many relationship set from the identifying to the weak entity set • Identifying relationship depicted using a double diamond • The discriminator (or partial key) of a weak entity set is the set of attributes that distinguishes among all the entities of a weak entity set. • The primary key of a weak entity set is formed by the primary key of the strong entity set on which the weak entity set is existence dependent, plus the weak entity set’s discriminator.

  46. Weak Entity Sets (Cont.) • We underline the discriminator of a weak entity set with a dashed line. • We put the identifying relationship of a weak entity in a double diamond. • Discriminator of the weak entity set is underlined by dashed lines • Primary key for section – (course_id, sec_id, semester,year)

  47. Weak Entity Sets • We depict a weak entity set by double rectangles. • We underline the discriminator of a weak entity set with a dashed line. • payment-number – discriminator of the payment entity set • Primary key for payment – (loan-number, payment-number)

  48. Example student instructor enrolls teaches offering isoffered course requires

  49. Generalization • A bottom-up design process – combine a number of entity sets that share the same features into a higher-level entity set. • Specialization and generalization are simple inversions of each other; they are represented in an E-R diagram in the same way. • The terms specialization and generalization are used interchangeably.

  50. Aggregation • Consider the ternary relationship works-on, which we saw earlier • Suppose we want to record managers for tasks performed by an employee at a branch

More Related