High-Level Database Models Spring 2011 Instructor: Hassan Khosravi - - PowerPoint PPT Presentation

High-Level Database Models

Spring 2011 Instructor: Hassan Khosravi

4.2

Database Modeling and implemnation process

Ideas High-Level Design Relational Database Schema Relational DBMS

4.3

The Entity/Relationship Model



The structure of data is represented graphically using

 Entity sets

 An abstract object of some sort

 Attributes

 properties of the entities  Primitive type : String, integer, real

 Relationships  Connections among entities.

4.4

Entity/Relationship Diagram



Entity sets are represented by rectangles



Attributes are represented by ovals



Relationships are represented by diamonds

Movies Stars-in Star name title year length type Studios address name address Owns

4.5

Multiplicity of Binary E/R Relationships



In general, a binary relationship can connect any member of one of its entity sets to any number of members of the other entity set.



Suppose R is a relation connecting entity sets E and F

 If each member of E can be connected by R to at most one

member of F, then we say R is many-one from E to F

 If each member of F can be connected by R to at most one

member of E, then we say R is many-one from F to E, or one- many from E to F

Movies Stars-in Star name title year length type address e1 e2 e3 f

4.6



Example of a many-one relationship from Movie to studio

Movies title year length type Studios name address Owns

4.7



If R is both many-one from E to F and many-one from F to E then we say that R is one to one

Studios Presidents Runs

4.8

Multiway Relationships



E/R model makes it convenient to define relationships involving more than two entity sets.



An arrow pointing to an entity E means that if we select one entity from each of the other entity sets, those entities are related to at most

• ne entity in E.

Movies Contracts Stars Studios

4.9

Limitations on Arrow notation



Not enough choice of arrow to determine every situation

 Movie determines studio?  stars determine studio?  Movie + star determine studio?

Movies Contracts Stars Studios

4.10

Roles in Relationships



It is possible that one entity set appears two or more times in a single

• relationship. If so, we draw as many lines from the relationship to the

entity set as the entity set appears in the relationship.



One studio having a certain star under contract (in general) , one for a specific film.

Contracts(starname, title, year, studioOfstar, producingStudio)

4.11

Roles in Relationships



What do the arrows mean?

 Given a star, a movie, and a producing studio, the studio of the

star is unique

 Given a star, a movie, and a studio for star, the producing studio

is unique

4.12

Attributes on relationships



Sometimes it is convenient or even essential to associate attributes with a relationship.



Salary can not be part of stars table as they might get different salary for different movies.



Salary cannot be part of Movies as different stars getting different salaries.

Movies Contracts Stars name title year length type Studios salary address name address

4.13

Attributes on relationships



It is never necessary to place attributes on relationships. We can instead invent a new entity set

Movies Contracts Stars name title year length type Studios salary address name address Salary

4.14

Converting Multiway relationships to Binary



E/R model does not require binary relationships, but other models do

 UML(4.7) and ODL(4.9) limit relationships to be binary



It is generally useful to observe that any relationship connecting more than two entity sets can be converted to a collection of binary relations.

4.15

Subclasses in the E/R Model



An entity set may contain certain entities that have special properties not associated with all members of the set.

 We can use a “isa” relationship which is presented by a triangle

 Cartoons have voice of stars  Murder mysteries have weapon

 In general entity sets connected by “isa” relationship could have

any structure. We shall limit it to trees

4.16

Subclasses in the E/R Model



Typical movies being neither will have 4 attributes



A cartoon movie would have 4 attributes and voice relationship



A murder mystery would have 5 attributes



A movie like Roger Rabbit which is both a cartoon and a murder mystery will have 5 attributes and voice relationship

4.17

Design Principles



Faithfulness



Avoiding redundancy



Simplicity



Right relationships



Right elements

4.18

Faithfulness



The design must be faithful to the specification of the application. It should reflect reality.

 The stars-in relation between stars and movies must be many to

many as observed in real world

 Sometimes it is less obvious

 Instructors, courses and a relation teaches between them. Is

the relation many-many? Many-one? – The answer relies on the schools policy that a few instructors could teach the same course or not.

4.19

Avoiding Redundancy



We should be careful to say everything once.

 Redundancy: Unnecessarily repeated info in several tuples

 Star Wars, 1977, 124, SciFi, and Fox is repeated.

 Update Anomaly: Changing information in one tuple but leaving

the same info unchanged in another

 If you find out that Star Wars is 125 minute and you don’t

update all of them, you will lose the integrity.

 Deletion Anomaly: Deleting some info and losing other info as a

side effect

Title Year Length Genre StudioName StarName Star Wars 1977 124 SciFi Fox Carrie Fisher Star Wars 1977 124 SciFi Fox Mark Hamill Star Wars 1977 124 SciFi Fox Harrison Ford Gone with the wind 1939 231 Drama MGM Vivien Leigh Wayne’s World 1992 95 Comedy Paramount Dana Carvey Wayne’s World 1992 95 Comedy Paramount Mike Meyers

4.20

Simplicity



Avoid introducing more elements into your design than is absolutely

• necessary. We need to make the data as abstract as possible

 Existence of movie-holdings which shows the ownership of a

single movie.

 This structure is closer to reality, however it holds no useful info

4.21

Right Relationships

Movies Contracts Stars Studios

Movies Stars-in Star Studios Owns



We omitted the owns and the stars-in relationships when we introduced contract was that a right decision?

 We don’t know. It depends on our assumptions

 It might be possible to deduce the relationship stars-in from

• contract. If a star can appear in a movie only with a contract.

– However there may be no contract – They may be no recorded contract

 If for every movie there is at least one contract involving the

movie, the studio and some stars then we can eliminate owns

 If a studio can own a movie and yet there are still no stars then

we can not eliminate owns

4.22

Right Relationships



We can use the two relationships stars-in and owns to conclude that a star could work for a studio.

 Is it rational to add such a relationship?

 Depends, if it doesn’t add any new info basically means that

star working for a movie owned by the studio then no

 If its possible to work for a studio without being on the movie

then yes

4.23

Right Elements

 were we wise to make studio

an entity instead of adding it to the movie table



Redundancy in address

 What if there was no address

for studio?



Then it would have been reasonable. Movies Stars-in Star name title year length type Studios address name address Owns

4.24

Right Elements



Conditions under which we prefer to use an attribute instead of an entity set



Suppose E is an entity set

 E must be the “one” in many-one relationships

 If the movie can have more than studio it wouldn’t make sense

to have an attribute for it

 The only key for E is all its attributes

 Address was dependent on name and that was stopping us

from using studio as a attribute

 No relationship involves E more than once

4.25

Constraints in the E/R Model



Keys in the E/R model



Referential integrity



Degree Constraints

4.26

Keys in the E/R Model



Every entity set must have a key

 In some cases isa and weak entity sets have keys that belong to

• ther tables



There can be more than one key, we pick one to be the primary key.



In isa relationships we require the root to have all the attributes needed for a key.



We underline the attributes belonging to a key for an entity set.

Movies Stars-in Star name title year length type address

4.27

Referential Integrity



Many-one requirements simply says that no movie can be owned by two studios. It doesn’t say that a movie must be owned by a studio.



The owns relationship has a referential integrity constraint

 There must be one owning studio.  The studio must be listed in the studio tables.



Suppose R is a relationship from E to F

 A rounded arrow-head pointing to F indicates not only that the

relationship is many-one from E to F, but that the entity of set F related to a given entity of set E is required to exist

Studios Presidents Runs Owns Movies

4.28

Degree Constraint



We can attach a bounding number



A movie entity cannot be connected by relationship Stars-in to more than 10 star entities



The constraint <=1 shows many-one relationship



The constraint =1 shows referential integrity

Movies Stars Stars-in ≤ 10

4.29

Weak Entity Sets



Causes of weak entity sets



Requirements for weak entity sets



Weak entity set notations

4.30

Causes of Weak Entity Sets



• 1. if entities of set E are subunits of entities in set F, then it is possible

that the names of E entities are not unique until we take into account the name of the F entity to which the E entity is subordinate.



If an entity set is weak, it will be shown as a rectangle with a double border.



Its supporting many-one relationships will be shown as diamonds with a double border.



If an entity set supplies any attributes for its own key, then those attributes will be underlined.

Stars-in Unit-of Crews Studios number name address

4.31

Causes of Weak Entity Sets



2.connecting entity sets to eliminate a multi-way relationship

 These entity sets often have no attributes of their own. Their

key is formed from the attributes that are the key attributes for the entity sets they connect.

Stars-in Star-of Stars-in Studio-of Stars-in Movie-of Contract salary Movies title year length type Star name address Studios name address

4.32

Requirements for Weak Entity Sets



if E is a weak entity set, then its key consists of:

 Zero or more of its own attributes, and  Key attributes from entity sets that are reached by certain many-

• ne relationships from E to other entity sets. These many-one

relationships are called supporting relationships for E.

Stars-in Unit-of Crews Studios number name address

4.33

Requirements for Weak Entity Sets



In order for R, a many-one relationship from E to some entity set F, to be a supporting relationship for E, the following conditions must be

• beyed:

 R must be a binary, many-one relationship from E to F.  R must have referential integrity from E to F.  The attributes that F supplies for the key of E must be key

attributes of F.

 It is recursive if F itself is weak.



Multiple supporting relationships are possible

Stars-in Unit-of Crews Studios number name address

4.34

Weak Entity Sets Notation

• 1. If an entity set is weak, it will be shown as a rectangle with a double

border

• 2. Its supporting many-one relationship will be shown as diamonds with a

double border

• 3. If an entity set supplies any attributes for its own key, then those

attributes will be underlined



Whenever we use an entity set E with a double border, it is weak. The key for E is whatever attributes of E are underlined plus the key attributes of those entity sets to which E is connected by many-one relationships with a double border.

Stars-in Unit-of Crews Studios number name address

4.35

From E/R Diagrams to Relational Designs



From Entity Sets to Relations



From E/R Relationships to Relations



Combining Relations



Handling Weak Entity Sets

4.36

General algorithm



Turn each entity set into a relation with the same set of attributes



Replace a relationship by a relation whose attributes are the keys for the connected entity sets.



Special situations

 Weak entity sets cannot be translated straightforwardly to

relations

 “Isa” relationships and subclasses require careful treatment  Sometimes, we do well to combine two relations, especially the

relation for an entity set E and the relation that comes from a many-one relationship from E to some other entity set

4.37

From Entity Sets to Relations



For each non-weak entity set Movies (title, year, length, genre) Stars (name, address)

Movies Stars-in Star name title year length type address

4.38

From E/R Relationships to Relations



Relationships Relations

 For each entity set involved in relationship R, we take its key

attribute and key attributes of its entities as part of the schema of the relation for R

 If the relationship has attributes, then these are also attributes of

relation for R



StarsIn (title, year, starName)

Movies Stars-in Star name title year length type address

4.39

From E/R Relationships to Relations



Multiway relations are also easy to convert to relations.

Contracts(starname, title, year, studioOfstar, producingStudio)

4.40

Combining Relations

 Combine relations for an entity set E and a

relationship R (from E to F).

 Requirements:

 R is a many-to-one relationship  Both relations E and R contain the key attribute(s) of E

 Then we can combine E and R with a new schema:

 All attributes of E  The key attribute of F  Any attributes belonging to relationship R

4.41

Combining Relations



Movie(title,year,length,filmType) and owns can be combined into one relation

 Movie1(title,year,length,filmType, studioname)

How about an entity e in E is not related to any entity in F?

 “Null” value is introduced (it is not a formal part in relational model,

but it is available in SQL).

Studios

• wns

Movies

4.42

Combining Relations

4.43

Handling Weak Entity Sets



When weak entity sets appear

 The relation for the weak entity set W itself must include not only

the attributes of W but also the key attributes of the supporting entity sets.

 The relation for any relationship in which the weak entity set W

appears must use as a key for W all of its key attributes, including those of other entity sets that contribute to W’s key.

 However, a supporting relationship R, from the weak entity set W

to a supporting entity set, need not to be converted to a relation at all.

Stars-in Unit-of Crews Studios number name address CrewChief

4.44

Handling Weak Entity Sets



Studio (name, addr)



Crews (number, studioName, crewChief)



Unit-of (number, studioName, name)

 A supporting relationship needs no relation

Stars-in Unit-of Crews Studios number name address CrewChief

4.45

Handling Weak Entity Sets



Modified rules

 If W is a weak entity set, construct for W a relation whose schema

consists of:

• 1. All attributes of W
• 2. All attributes of supporting relationships for W
• 3. For each supporting relationships for W, say a many-one

relationship from W to entity set E, all the key attributes of E

• 4. Rename attributes, if necessary, to avoid name conflicts



–Do not construct a relation for any supporting relationship for W

4.46

Converting Subclass Structures to Relations



The principal conversion strategies

 Follow the E/R viewpoint  Treat entities as objects belonging to a single class  Use null values

4.47

E/R-Style Conversion



The approach

 Create a relation for each entity set, as usual.  If the entity set E is not the root of the hierarchy, then the relation

for E will include the key attributes at the root, to identify the entity represented by each tuple, plus all the attributes of E.



Example

 Movies (title, year, length, genre)  MurderMysteries (title, year, weapon)  Cartoon (title, year)  Voice(title, year, starName)

4.48

An Object-Oriented Approach



The approach

 Enumerate all the possible subtrees that includes the root.  For each, create one relation that represents entities having

components in exactly that subtree.

 The schema for this relation has all the attributes of any entity set

in the subtree. The assumption that entities are “objects” that belong to one and only one class.



Movies (title, year, length, genre)



MoviesC (title, year, length, genre)



MoviesMM (title, year, length, genre, weapon)



MoviesCMM (title, year, length, genre, weapon)



Voice(title, year, starName)

4.49

Using Null Values to Combine Relations



The Approach

 Create one relation with all the attributes of all the entity sets in the

hierarch.

 Each entity is represented by one tuple, and that tuple has a null

value for whatever attributes the entity does not have. Movies (title, year, length, genre, weapon)

4.50

Comparison of Approaches

• 1. For answering query the null method is faster because doesn’t need to

join the tables.

 What films of 2008 were longer than 150 minutes?

 In E/R model it can be directly answered from the movie table

but in the object oriented approach we need to look at all tables

 What weapons were used in cartoons over 150 minutes

 Is more difficult in the E/R model  In the object oriented method we need to only look at the

MoviesCMM table

4.51

Comparison of Approaches

• 1. Not to use too many relations

 The null method shines  The E/R approach uses one relation per entity set  Object oriented approach could have as many as 2 n relations

where n is the number of entities.

• 2. Minimize space and avoid redundancy

 Object oriented approach takes minimum space, nothing is

repeated

 The null method has a long tuple per each entity which may have

many nulls. Potentially, with many entity sets in the hierarchy, a lot

• f nulls may happen

 E/R method several tuples for each entity and the keys are

repeated could take more or less space than null method.

4.52

Unified modeling Language



Lecture given by Dr. Widom on Unified modeling Language