slide 1 chapter 6 – part 1 transforming data models into database designs
TRANSCRIPT
Slide 1
Chapter 6 – Part 1Chapter 6 – Part 1
Transforming Data Transforming Data Models into Database Models into Database
DesignsDesigns
Slide 2
ContentsContents
A. Computer Company ProblemB. Solution
Slide 3
A. Computer Company ProblemA. Computer Company Problem
ProgLtd is a company that places computer programmers at temporary jobs. They keep track on each programmer: the programmer's identification number, the programmer's last name, the programmer's first name, the programmer's rank (Junior, Senior ...), gender, his/her hourly rate and what languages the programmer knows. Beside, each programmer has been issued a badge which is used for enter their office. On each badge has following information: badge’s code, the programmer's identification number, issued date.
Slide 4
ProgLtd deals with clients who may require programmers who know a particular programming language and may request programmers who are experienced in such a programming. Once a programmer is assigned a temporary job, ProgLtd would like to keep track of when he/she started the job, the total number of hours he/she is expected to spend at job and the date he/she finished the job. That is in addition to the client name and phone number where the temp has been assigned.
Let’s design DB diagram for above requirements
Slide 5
B. SolutionsB. Solutions
1. Logical Analysis2. Physical Analysis
Slide 6
1. Logical Analysis1. Logical Analysis
Slide 7
2. Physical Analysis2. Physical Analysis
2.1. Steps for Transforming a Data Model into a Database
Design.2.2. Create Table for Each Entity.2.3. Create Relationships.2.4. Design for Minimum Cardinality.2.5. Physical Diagram.
Slide 8
2.1. Steps for Transforming a 2.1. Steps for Transforming a Data Model into a Database Data Model into a Database Design.Design.
Slide 9
2.2. Create Table for Each Entity2.2. Create Table for Each Entity
2.2.1. Create a Table for Each Entity.2.2.2. Select the Primary Key.2.2.3. Specify Candidate (Alternate) Keys.2.2.4. Specify Column Properties.
Slide 10
2.2.1. Create a Table for Each 2.2.1. Create a Table for Each EntityEntity
Slide 11
2.2.2. Select the Primary Key2.2.2. Select the Primary Key
The ideal primary key is short, numeric and fixed
Surrogate keys meet the ideal, but have no meaning to users
Slide 12
2.2.3. Specify Candidate 2.2.3. Specify Candidate (Alternate) Keys(Alternate) Keys
The terms candidate key and alternate key are synonymous
Candidate keys are alternate identifiers of unique rows in a table
ERwin uses AKn.m notation, where n is the number of the alternate key, and m is the column number in that alternate key
Slide 13
2.2.4. Specify Column Properties2.2.4. Specify Column Properties
2.2.4.1. Specify Data Type.2.2.4.2. Specify Default Value.2.2.4.3. Specify Data Constraints.
Slide 14
2.2.4.1. Specify Data Type2.2.4.1. Specify Data Type
2.2.4.1.1. SQL Server Data Types.2.2.4.1.2. Data Types on Table.
Slide 15
2.2.4.1.1. SQL Server Data Types2.2.4.1.1. SQL Server Data Types
Slide 16
2.2.4.1.2. Data Types on Table2.2.4.1.2. Data Types on Table
Slide 17
2.2.4.2. Specify Default Value2.2.4.2. Specify Default Value
A default value is the value supplied by the DBMS when a new row is createdExample: Default value of PRO_Hourly_Rate is 15$
Slide 18
2.2.4.3. Specify Data Constraints2.2.4.3. Specify Data Constraints
Data constraints are limitations on data values: Domain constraint - Column values must be in a
given set of specific values Range constraint - Column values must be
within a given range of values Intrarelation constraint – Column values are
limited by comparison to values in other columns in the same table
Interrelation constraint - Column values are limited by comparison to values in other columns in other tables [Referential integrity constraints on foreign keys]
Slide 19
2.3. Create Relationships2.3. Create Relationships
2.3.1. 1:1 Entity Relationships2.3.2. 1:N Entity Relationships2.3.3. N:M Entity Relationships
Slide 20
2.3.1. 1:1 Entity Relationships2.3.1. 1:1 Entity Relationships
Place the key of one entity in the other entity as a foreign key: Either design will work – no parent, no child Minimum cardinality considerations may be
important:O-M will require a different design that M-O, and one design will be very preferable.
Slide 21
2.3.2. 1:N Entity Relationships2.3.2. 1:N Entity Relationships
Place the primary key of the table on the one side of the relationship into the table on the many side of the relationship as the foreign key
The one side is the parent table and the many side is the child table, so “Place the key of the parent in the child”
Slide 22
2.3.3. N:M Entity Relationships2.3.3. N:M Entity Relationships
In an N:M strong entity relationship there is no place for the foreign key in either table
The solution is to create an intersection table that stores data about the corresponding rows from each entity
The intersection table consists only of the primary keys of each table which form a composite primary key
Each table’s primary key becomes a foreign key linking back to that table
Slide 23
Slide 24
2.4. Design for Minimum 2.4. Design for Minimum CardinalityCardinality
2.4.1. Types of minimum cardinality.2.4.2. Cascading Updates and Deletes.2.4.3. Actions to Apply to Enforce Minimum
Cardinality.2.4.4. Implementing Actions.
Slide 25
2.4.1. Types of minimum 2.4.1. Types of minimum cardinalitycardinality
Relationships can have the following types of minimum cardinality: O-O : Parent optional and child optional M-O : Parent mandatory and child optional O-M : Parent optional and child mandatory M-M : Parent mandatory and child mandatory
We will use the term action to mean a minimum cardinality enforcement action.
No action needs to be taken for O-O relationships.
Slide 26
2.4.2. Cascading Updates and 2.4.2. Cascading Updates and DeletesDeletes
A cascading update occurs when a change to the parent’s primary key is applied to the child’s foreign key. Surrogate keys never change and there is no need for
cascading updates when using them.
A cascading delete occurs when associated child rows are deleted along with the deletion of a parent row. For strong entities, generally do not cascade deletes. For weak entities, generally do cascade deletes.
Slide 27
2.4.3. Actions to Apply to Enforce 2.4.3. Actions to Apply to Enforce Minimum CardinalityMinimum Cardinality
Slide 28
2.4.4. Implementing Actions2.4.4. Implementing Actions
2.4.4.1. Implementing Actions for M-O Relationships.
2.4.4.2. Implementing Actions for O-M Relationships.
2.4.4.3. Implementing Actions for M-M Relationships.
2.4.4.4. What is trigger?
Slide 29
2.4.4.1. Implementing Actions for 2.4.4.1. Implementing Actions for M-O RelationshipsM-O Relationships
Make sure that: Every child has a parent. Operations never create orphans.
The DBMS will enforce the action as long as: Referential integrity constraints are properly defined. The foreign key column is NOT NULL.
Slide 30
2.4.4.2. Implementing Actions for 2.4.4.2. Implementing Actions for O-M RelationshipsO-M Relationships
The DBMS does not provide much help. Triggers or other application code will need to
be written.
Slide 31
2.4.4.3. Implementing Actions for 2.4.4.3. Implementing Actions for M-M RelationshipsM-M Relationships
The DBMS does not provide much help. Complicated and careful application
programming will be needed.
Slide 32
2.4.4.4. What is trigger?2.4.4.4. What is trigger?
Application programming uses SQL embedded in triggers, stored procedures, and other program code to accomplish specific tasks.
A trigger is a stored program that is executed by the DBMS whenever a specified event occurs on a specified table or view.
Triggers are used to enforce specific minimum cardinality enforcement actions not otherwise programmed into the DBMS.
Slide 33
2.5. Physical Diagram 2.5. Physical Diagram
Slide 34