Document Details

YouthfulTsavorite7659

Uploaded by YouthfulTsavorite7659

Vietnam-France University

2024

Nguyen Hoang Ha

Tags

database design entity relationship diagrams database modelling Fundamentals of Databases

Summary

This lecture covers Entity Relationship Diagrams (ERD). It discusses how to design a database, explaining different approaches and including examples. The document is about high-level database models, outlining the fundamental components for designing a database.

Full Transcript

FUNDAMENTALS OF DATABASES High level database model – Entity Relationship NGUYEN Hoang Ha Email: [email protected] Nguyen Hoang Ha and Le Huu Ton, Fundamentals of Databases, Chapter 5, USTH’s textbook preprint version, 2024...

FUNDAMENTALS OF DATABASES High level database model – Entity Relationship NGUYEN Hoang Ha Email: [email protected] Nguyen Hoang Ha and Le Huu Ton, Fundamentals of Databases, Chapter 5, USTH’s textbook preprint version, 2024 DB Modelling and Implementation Process High-Level RDB Ideas RDBMS Design Schema 2 How to express High-Level Design  There are several options for the notation in which the high- level design is expressed  The first and oldest method is the “Entity Relationship Diagram”  A more recent trend is the use of UML (“Unified Modeling Language”)  We don’t focus on UML in our lessons now but ERD 3 Objectives  Know or understand  Entity Sets  Relationship  Weak Entity  ERD  ERD → DB schema 4 E/R Model and ERD  Entity Relationship Model (E/R model) represents the structure of data graphically as an “ERD” using 3-principal element types: 1. Entity Sets 2. Attributes 3. Relationships  We shall cover all them next 5 Framework for E/R  Design is a serious business.  The “boss” knows they want a database, but they don’t know what they want in it.  Sketching the key components is an efficient way to develop a working database. 6 6 Entity Sets  Entity = “thing” or object.  Entity set = collection of similar entities.  Similar to a class in object-oriented languages.  Attribute = property of (the entities of) an entity set.  Attributes are simple values, e.g. integers or character strings, not structs, sets, etc. 7 7 E/R Diagrams  In an entity-relationship diagram:  Entity set = rectangle.  Attribute = oval, with a line to the rectangle representing its entity set. 8 8 Example: name manf Beers  Entity set Beers has two attributes, name and manf (manufacturer).  Each Beers entity has values for these two attributes, e.g. (Bud, Anheuser-Busch) 9 9 Relationships  A relationship connects two or more entity sets.  It is represented by a diamond, with lines to each of the entity sets involved. 10 10 Example: Relationships name addr name manf Bars sell some Bars Sells Beers beers. license Drinkers like some beers. Frequents Likes Note: license = Drinkers frequent beer, full, some bars. none Drinkers name addr 11 11 Multiway Relationships  Sometimes, we need a relationship that connects more than two entity sets.  Suppose that drinkers will only drink certain beers at certain bars.  Our three binary relationships Likes, Sells, and Frequents do not allow us to make this distinction.  But a 3-way relationship would. 12 12 Example: 3-Way Relationship name addr name manf license Bars Beers Preferences Drinkers name addr 13 13 A Typical Relationship Set Bar Drinker Beer Joe’s Bar Ann Miller Sue’s Bar Ann Bud Sue’s Bar Ann Pete’s Ale Joe’s Bar Bob Bud Joe’s Bar Bob Miller Joe’s Bar Cal Miller Sue’s Bar Cal Bud Lite 14 14 Multiplicity (cardinality) of Relationships one-one many-one many-many 15 Many-Many Relationships  Eg: such as Sells between Bars and Beers.  In a many-many relationship, an entity of either set can be connected to many entities of the other set.  E.g., a bar sells many beers; a beer is sold by many bars. 16 16 Many-One Relationships  Some binary relationships are many -one from one entity set to another.  Each entity of the first set is connected to at most one entity of the second set.  But an entity of the second set can be connected to zero, one, or many entities of the first set. 17 17 Example: Many-One Relationship  Favorite, from Drinkers to Beers is many-one.  A drinker has at most one favorite beer.  But a beer can be the favorite of any number of drinkers, including zero. 18 18 One-One Relationships  In a one-one relationship, each entity of either entity set is related to at most one entity of the other set.  Example: Relationship Best-seller between entity sets Manfs (manufacturer) and Beers.  A beer cannot be made by more than one manufacturer, and no manufacturer can have more than one best-seller (assume no ties). 19 19 Representing “Multiplicity”  Show a many-one relationship by an arrow entering the “one” side.  Remember: Like a functional dependency.  Show a one-one relationship by arrows entering both entity sets.  Rounded arrow = “exactly one,” i.e., each entity of the first set is related to exactly one entity of the target set. 20 20 Example: Many-One Relationship Drinkers Likes Beers Notice: two relationships Favorite connect the same entity sets, but are different. 21 21 Example: One-One Relationship  Consider Best-seller between Manfs and Beers.  Some beers are not the best-seller of any manufacturer, so a rounded arrow to Manfs would be inappropriate.  But a beer manufacturer has to have a best-seller. 22 22 In the E/R Diagram Manfs Best- Beers seller A beer is the best- A manufacturer has seller for 0 or 1 exactly one best manufacturer. seller. 23 23 Attributes on Relationships  Sometimes it is useful to attach an attribute to a relationship.  Think of this attribute as a property of tuples in the relationship set. 24 24 Example: Attribute on Relationship Bars Sells Beers price Price is a function of both the bar and the beer, not of one alone. 25 25 Equivalent Diagrams Without Attributes on Relationships  Create an entity set representing values of the attribute.  Make that entity set participate in the relationship. 26 26 Example: Removing an Attribute from a Relationship Bars Sells Beers Note convention: arrow Prices from multiway relationship = “all other entity sets together determine a unique one of these.” price 27 27 Roles  Sometimes an entity set appears more than once in a relationship.  Label the edges between the relationship and the entity set with names called roles. 28 28 Example: Roles Relationship Set Husband Wife Bob Ann Married Joe Sue … … husband wife Drinkers 29 29 Example: Roles Relationship Set Buddy1 Buddy2 Bob Ann Joe Sue Buddies Ann Bob Joe Moe 1 2 … … Drinkers 30 30 Subclasses  Subclass = special case = fewer entities = more properties.  Example: Ales are a kind of beer.  Not every beer is an ale, but some are.  Let us suppose that in addition to all the properties (attributes and relationships) of beers, ales also have the attribute color. 31 31 Subclasses in E/R Diagrams  Assume subclasses form a tree.  I.e., no multiple inheritance.  Isa triangles indicate the subclass relationship.  Point to the superclass. 32 32 Example: Subclasses name Beers manf isa color Ales 33 33 Example: Representatives of Entities name Beers manf Pete’s Ale isa color Ales 34 34 Keys  A key is a set of attributes for one entity set such that no two entities in this set agree on all the attributes of the key.  It is allowed for two entities to agree on some, but not all, of the key attributes.  We must designate a key for every entity set.  Keys in E/R Diagrams  Underline the key attribute(s).  In an Isa hierarchy, only the root entity set has a key, and it must serve as the key for all entities in the hierarchy. 35 35 Example: name is Key for Beers name Beers manf isa color Ales 36 36 Example: a Multi-attribute Key dept number hours room Courses Note that hours and room could also serve as a key, but we must select only one key. 37 37 Weak Entity Sets  Occasionally, entities of an entity set need “help” to identify them uniquely.  Entity set E is said to be weak if in order to identify entities of E uniquely, we need to follow one or more many-one relationships from E and include the key of the related entities from the connected entity sets. 38 38 Example: Weak Entity Set  name is almost a key for football players, but there might be two with the same name.  number is certainly not a key, since players on two teams could have the same number.  But number, together with the team name related to the player by Plays-on should be unique. 39 39 In E/R Diagrams Player Name number name Player Player for Team Note: must be rounded because each player needs a team to help with the key. Double diamond for supporting many-one relationship. Double rectangle for the weak entity set. 40 Weak Entity-Set Rules  A weak entity set has one or more many-one relationships to other (supporting) entity sets.  Not every many-one relationship from a weak entity set need be supporting.  But supporting relationships must have a rounded arrow (entity at the “one” end is guaranteed).  The key for a weak entity set is its own underlined attributes and the keys for the supporting entity sets. 41 Design Techniques 1. Avoid redundancy. 2. Limit the use of weak entity sets. 3. Don’t use an entity set when an attribute will do. 42 Avoiding Redundancy  Redundancy = saying the same thing in two (or more) different ways.  Wastes space and (more importantly) encourages inconsistency.  Two representations of the same fact become inconsistent if we change one and forget to change the other.  Recall anomalies due to FD’s. 43 43 Example: Good name name addr Beers ManfBy Manfs This design gives the address of each manufacturer exactly once. 44 44 Example: Bad name name addr Beers ManfBy Manfs manf This design states the manufacturer of a beer twice: as an attribute and as a related entity. 45 45 Example: Bad name manf manfAddr Beers This design repeats the manufacturer’s address once for each beer and loses the address if there are temporarily no beers for a manufacturer. 46 46 Entity Sets Versus Attributes  An entity set should satisfy at least one of the following conditions:  It is more than the name of something; it has at least one nonkey attribute. or  It is the “many” in a many-one or many-many relationship. 47 47 Example: Good name name addr Beers ManfBy Manfs Manfs deserves to be an entity set because of the nonkey attribute addr. Beers deserves to be an entity set because it is the “many” of the many-one relationship ManfBy. 48 48 Example: Good name manf Beers There is no need to make the manufacturer an entity set, because we record nothing about manufacturers besides their name. 49 49 Example: Bad name name Beers ManfBy Manfs Since the manufacturer is nothing but a name, and is not at the “many” end of any relationship, it should not be an entity set. 50 50 Don’t Overuse Weak Entity Sets  Beginning database designers often doubt that anything could be a key by itself.  They make all entity sets weak, supported by all other entity sets to which they are linked.  In reality, we usually create unique ID’s for entity sets.  Examples include social-security numbers, automobile VIN’s etc. 51 51 Exercise 52 From E/R Diagrams to Relations  Entity set → relation.  Attributes → attributes.  Relationships -> relations whose attributes are only:  The keys of the connected entity sets.  Attributes of the relationship itself. 53 53 Entity Set → Relation name manf Beers Relation: Beers(name, manf) 54 54 Relationship → Relation name addr name manf Drinkers Likes Beers husband 1 2 Favorite Buddies Likes(drinker, beer) Favorite(drinker, beer) wife Buddies(name1, name2) Married Married(husband, wife) 55 55 Combining Relations  OK to combine into one relation: 1. The relation for an entity-set E 2. The relations for many-one relationships of which E is the “many.”  Example: Drinkers(name, addr) and Favorite(drinker, beer) combine to make Drinker1(name, addr, favBeer). 56 56 Risk with Many-Many Relationships  Combining Drinkers with Likes would be a mistake. It leads to redundancy, as: name addr beer Sally 123 Maple Bud Sally 123 Maple Miller Redundancy 57 57 Handling Weak Entity Sets  Relation for a weak entity set must include attributes for its complete key (including those belonging to other entity sets), as well as its own, nonkey attributes.  A supporting relationship is redundant and yields no relation (unless it has attributes). 58 58 Example: Weak Entity Set -> Relation name name billTo Logins At Hosts location Hosts(hostName, location) Logins(loginName, hostName, billTo) At(loginName, hostName, hostName2) Must be the same At becomes part of Logins 59 59 Subclasses: Three Approaches 1. Object-oriented : One relation per subset of subclasses, with all relevant attributes. 2. Use nulls : One relation; entities have NULL in attributes that don’t belong to them. 3. E/R style : One relation for each subclass:  Key attribute(s).  Attributes of that subclass. 60 60 Example: Subclass -> Relations name Beers manf isa color Ales 61 61 Object-Oriented name manf Bud Anheuser-Busch Beers name manf color Summerbrew Pete’s dark Ales Good for queries like “find the color of ales made by Pete’s.” 62 62 E/R Style Beers name manf Bud Anheuser-Busch Summerbrew Pete’s Ales name color Summerbrew dark Good for queries like “find all beers (including ales) made by Pete’s.” 63 63 Using Nulls name manf color Bud Anheuser-Busch NULL Summerbrew Pete’s beer dark Saves space unless there are lots of attributes that are usually NULL. 64 64

Use Quizgecko on...
Browser
Browser