3 Data Base Design
-
Upload
asif-mohammed -
Category
Documents
-
view
216 -
download
0
Transcript of 3 Data Base Design
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 1/42
1
Based on slides from the text book: Database System Concepts, 5th Ed.
Relational Database DesignRelational Database Design
7.2
Relational Database DesignRelational Database Design
Features of Good Relational Design
Atomic Domains and First Normal Form
Decomposition Using Functional Dependencies
Functional Dependency Theory
Algorithms for Functional Dependencies
Decomposition Using Multivalued Dependencies
More Normal Form Database-Design Process
Modeling Temporal Data
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 2/42
2
7.3
The Banking SchemaThe Banking Schema branch = (branch_name , branch_city , assets )
customer = (customer_id , customer_name , customer_street , customer_city )
loan = (loan_number , amount )
account = (account_number , balance )
employee = (employee_id . employee_name , telephone_number , start_date )
dependent_name = (employee_id , dname )
account_branch = (account_number , branch_name )
loan_branch = (loan_number , branch_name )
borrower = (customer_id , loan_number )
depositor = (customer_id , account_number )
cust_banker = (customer_id , employee_id , type )
works_for = (worker_employee_id , manager_employee_id )
payment = (loan_number , payment_number , payment_date , payment_amount )
savings_account = (account_number , interest_rate )
checking_account = (account_number , overdraft_amount )
7.4
Combine Schemas?Combine Schemas?
Suppose we combine borrower and loan to get
bor_loan = (customer_id , loan_number , amount )
Result is possible repetition of information (L-100 in example below)
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 3/42
3
7.5
A Combined Schema Without RepetitionA Combined Schema Without Repetition
Consider combining loan_branch and loan
loan_amt_br = (loan_number , amount , branch_name )
No repetition (as suggested by example below)
7.6
What About Smaller Schemas?What About Smaller Schemas?
Suppose we had started with bor_loan. How would we know to split up(decompose) it into borrower and loan ?
Write a rule “if there were a schema (loan_number, amount ), thenloan_number would be a candidate key”
Denote as a functional dependency:
loan_number amount
In bor_loan , because loan_number is not a candidate key, the amount of a loanmay have to be repeated. This indicates the need to decompose bor_loan .
Not all decompositions are good. Suppose we decompose employee into
employee1 = (employee_id , employee_name )
employee2 = (employee_name , telephone_number , start_date )
The next slide shows how we lose information -- we cannot reconstruct theoriginal employee relation -- and so, this is a lossy decomposition.
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 4/42
4
7.7
AA LossyLossy DecompositionDecomposition
7.8
First Normal FormFirst Normal Form
Domain is atomic if its elements are considered to be indivisible units
Examples of non-atomic domains:
Set of names, composite attributes
Identification numbers like CS101 that can be broken up intoparts
A relational schema R is in first normal form if the domains of allattributes of R are atomic
Non-atomic values complicate storage and encourage redundant(repeated) storage of data
Example: Set of accounts stored with each customer, and set ofowners stored with each account
We assume all relations are in first normal form
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 5/42
5
7.9
First Normal Form (ContFirst Normal Form (Cont’’d)d) Atomicity is actually a property of how the elements of the domain are
used.
Example: Strings would normally be considered indivisible
Suppose that students are given roll numbers which are strings ofthe form CS0012 or EE1127
If the first two characters are extracted to find the department, thedomain of roll numbers is not atomic.
Doing so is a bad idea: leads to encoding of information inapplication program rather than in the database.
7.10
GoalGoal —— Devise a Theory for the FollowingDevise a Theory for the Following
Decide whether a particular relation R is in “good” form.
In the case that a relation R is not in “good” form, decompose it into aset of relations {R 1, R 2, ..., R n } such that
each relation is in good form
the decomposition is a lossless-join decomposition
Our theory is based on:
functional dependencies
multivalued dependencies
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 6/42
6
7.11
NormalizationNormalization Normalization is a design technique that is
widely used as a guide in designing relationaldatabases. A two step process
that puts data into tabular form byremoving repeating groups
removes duplicated data from the relationaltables.
Based on the concepts of normal forms . Arelational table is in a particular normal form if
it satisfies a certain set of constraints. Five normal forms that have been defined
(manily by E.F. Codd)
7.12
NormalizationNormalization
Basic Concepts
Goal of normalization: create a set of relational tables that
are free of redundant data
can be consistently and correctly modified .
All tables in a relational database should be in the third normal form(3NF).
A relational table is in 3NF if and only if all non-key columns are
mutually independent: no non-key column is dependent upon anycombination of the other columns.
fully dependent upon the primary key.
The first two normal forms are intermediate steps to achieve thegoal of having all tables in 3NF.
Key preliminary concepts:
functional dependencies
lossless decomposition
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 7/42
7
7.13
Functional DependenciesFunctional Dependencies
The concept of functional dependencies is the basis for the first threenormal forms.
A column, Y, of the relational table R is said to be functionallydependent upon column X of R if and only if
each value of X in R is associated with precisely one value of Y atany given time.
X and Y may be composite.
Saying that column Y is functionally dependent upon X is the same assaying the values of column X identify the values of column Y. Ifcolumn X is a primary key, then all columns in the relational table Rmust be functionally dependent upon X. Constraints on the set of legal
relations. A short-hand notation for describing a functional dependency is:
R.x —>R.y
in the relational table named R, column x functionally determines(identifies) column y
7.14
Functional Dependencies (Cont.)Functional Dependencies (Cont.)
Let R be a relation schema
R and R
The functional dependency
holds on R if and only if for any legal relations r (R), whenever anytwo tuples t 1 and t 2 of r agree on the attributes , they also agreeon the attributes . That is,
t 1[] = t 2 [] t 1[ ] = t 2 [ ]
Example: Consider r (A,B ) with the following instance of r.
On this instance, A B does NOT hold, but B A does hold.
1 41 53 7
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 8/42
8
7.15
Functional Dependencies (Cont.)Functional Dependencies (Cont.)
K is a superkey for relation schema R if and only if K R
K is a candidate key for R if and only if
K R , and
for no K, R
Functional dependencies allow us to express constraints that cannotbe expressed using superkeys. Consider the schema:
bor_loan = (customer_id, loan_number, amount ).
We expect this functional dependency to hold:
loan_number amount
but would not expect the following to hold:
amount customer_name
7.16
Use of Functional DependenciesUse of Functional Dependencies
We use functional dependencies to:
test relations to see if they are legal under a given set of functionaldependencies.
If a relation r is legal under a set F of functional dependencies, wesay that r satisfies F.
specify constraints on the set of legal relations
We say that F holds on R if all legal relations on R satisfy the set of
functional dependencies F. Note: A specific instance of a relation schema may satisfy a functional
dependency even if the functional dependency does not hold on all legalinstances.
For example, a specific instance of loan may, by chance, satisfyamount customer_name.
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 11/42
11
7.21
SecondSecond NormalNormal FormForm (2NF)(2NF) A relational table is in second normal form 2NF if
it is in 1NF and
every non-key column is fully dependent upon theprimary key. That is, every non-key column must bedependent upon the entire primary key.
FIRST is in 1NF but not in 2NF because status and cityare functionally dependent upon only on the column s# ofthe composite key (s#, p#). This can be illustrated bylisting the functional dependencies in the table:
s# —> city,
status city —> status
(s#,p#) —>qty
7.22
2NF2NF -- exampleexample The process for transforming a 1NF table to 2NF is:
identify any attributes, not in composite key, and the columns they determine.
Create new table for each such attribute and the unique columns it determines.
Move determined columns to the new table. Determinant attr. becomes primary key.
Delete the columns moved from the original table except for the determinant: servesas a foreign key .
Tables in 2NF still suffer modification anomalies:
In SECOND, they are:
INSERT. The fact that a particular city has a certain
status (Rome has a status of 50) cannot be inserted
until there is a supplier in the city.
DELETE. Deleting any row in SUPPLIER destroys
the status information about the city as well
as the association between supplier and city.
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 12/42
12
7.23
Third Normal FormThird Normal Form The third normal form requires that all nonkey attributes are
functionally dependent only upon the primary key – with NO transitivedependencies
A transitive dependency is occurs when
a non-key column that is a determinant of the primary key is thedeterminate of other columns.
A relation schema R is in third normal form (3NF) if for all:
in F +
at least one of the following holds:
is trivial (i.e., )
is a superkey for R
Each attribute A in – is contained in a candidate key for R.
(NOTE: each attribute may be in a different candidate key)
If a relation is in BCNF it is in 3NF (since in BCNF one of the first twoconditions above must hold).
Third condition is a minimal relaxation of BCNF to ensure dependencypreservation (will see why later).
7.24
Third Normal FormThird Normal Form
Table PARTS is already in 3NF. The non-key column,
qty, is fully dependent upon the primary key (s#, p#).
SUPPLIER is in 2NF but not in 3NF because it containsa transitive dependency : non-key column that is a determinant
of the primary key is the determinate of other columns.
The concept of a transitive dependency can be illustrated by showing the
functional dependencies in SUPPLIER:
SUPPLIER.s# —> SUPPLIER.status
SUPPLIER.s# —> SUPPLIER.city
SUPPLIER.city —> SUPPLIER.status
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 13/42
13
7.25
Third Normal formThird Normal form The process of transforming a table into 3NF:
Identify any determinants, other the primary key, and the columns theydetermine.
Create and name a new table for each determinant and the uniquecolumns it determines.
Move the determined columns from the original table to the new table. Thedeterminate becomes the primary key of the new table.
Delete the columns you just moved from the original table except for thedeterminate which will serve as a foreign key.
The original table may be renamed to maintain semantic meaning.
SUPPLIER into 3NF
new table called CITY_STATUS
move the columns city and status into it.
Status is deleted from the original table,
city is left behind to serve as a foreign
key to CITY_STATUS,
original renamed to SUPPLIER_CITY
to reflect its semantics
7.26
AdvantagesAdvantages ofof ThirdThird NormalNormal FormForm
The advantage of having relational tables in 3NF is that it eliminatesredundant data which in turn saves space and reduces manipulationanomalies. For example, the improvements to our sample databaseare:
INSERT. Facts about the status of a city, Rome has a status of 50,can be added even though there is not supplier in that city. Likewise,facts about new suppliers can be added even though they have notyet supplied parts.
DELETE. Information about parts supplied can be deleted withoutdestroying information about a supplier or a city. UPDATE. Changingthe location of a supplier or the status of a city requires modifying onlyone row.
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 14/42
14
7.27
BoyceBoyce--CoddCodd Normal FormNormal Form
is trivial (i.e., )
is a superkey for R
A relation schema R is in BCNF with respect to a set F offunctional dependencies if for all functional dependencies in F + ofthe form
where R and R , at least one of the following holds:
A relational table is in BCNF if and only if every determinant is a candidate key.
Difference to 3NF: it is not necessary for the propert to hold:Each attribute A in – is contained in a candidate key for R Example schema not in BCNF:
bor_loan = ( customer_id, loan_number, amount )
because loan_number amount holds on bor_loan but loan_number isnot a superkey
7.28
Decomposing a Schema into BCNFDecomposing a Schema into BCNF
Suppose we have a schema R and a non-trivial dependency
causes a violation of BCNF.
We decompose R into:
• ( U )
• ( R - ( - ) )
In our example,
= loan_number
= amount and bor_loan is replaced by
( U ) = ( loan_number, amount )
( R - ( - ) ) = ( customer_id, loan_number )
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 15/42
15
7.29
BCNF and Dependency PreservationBCNF and Dependency Preservation
Constraints, including functional dependencies, are costly to check inpractice unless they pertain to only one relation
If it is sufficient to test only those dependencies on each individualrelation of a decomposition in order to ensure that all functionaldependencies hold, then that decomposition is dependencypreserving.
Because it is not always possible to achieve both BCNF anddependency preservation, we consider a weaker normal form, knownas third normal form.
7.30
Goals of NormalizationGoals of Normalization
Goal of normalization: create a set of relational tables that
are free of redundant data
can be consistently and correctly modified .
Let R be a relation scheme with a set F of functional dependencies.
Decide whether a relation scheme R is in “good” form.
In the case that a relation scheme R is not in “good” form, decompose itinto a set of relation scheme {R 1, R 2, ..., R n } such that
each relation scheme is in good form the decomposition is a lossless-join decomposition
Preferably, the decomposition should be dependency preserving.
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 16/42
16
7.31
How good is BCNF?How good is BCNF? There are database schemas in BCNF that do not seem to be
sufficiently normalized
Consider a database
classes (course, teacher, book )
such that (c, t, b ) classes means that t is qualified to teach c, and b is a required textbook for c
The database is supposed to list for each course the set of teachersany one of which can be the course’s instructor, and the set of books,all of which are required for the course (no matter who teaches it).
7.32
There are no non-trivial functional dependencies and therefore therelation is in BCNF
Insertion anomalies – i.e., if Marilyn is a new teacher that can teachdatabase, two tuples need to be inserted
(database, Marilyn, DB Concepts)(database, Marilyn, Ullman)
course teacher book
databasedatabasedatabasedatabasedatabasedatabaseoperating systemsoperating systems
operating systemsoperating systems
AviAviHankHankSudarshanSudarshanAviAvi
PetePete
DB ConceptsUllmanDB ConceptsUllmanDB ConceptsUllmanOS ConceptsStallings
OS ConceptsStallings
classes
How good is BCNF? (Cont.)How good is BCNF? (Cont.)
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 17/42
17
7.33
Therefore, it is better to decompose classes into:
course teacher
databasedatabasedatabaseoperating systemsoperating systems
AviHankSudarshanAviJim
teaches
course book
databasedatabaseoperating systemsoperating systems
DB ConceptsUllmanOS ConceptsShaw
text
This suggests the need for higher normal forms, such as FourthNormal Form (4NF), which we shall see later.
How good is BCNF? (Cont.)How good is BCNF? (Cont.)
7.34
FunctionalFunctional--Dependency TheoryDependency Theory
We now consider the formal theory that tells us which functionaldependencies are implied logically by a given set of functionaldependencies.
We then develop algorithms to generate lossless decompositions intoBCNF and 3NF
We then develop algorithms to test if a decomposition is dependency- preserving
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 18/42
18
7.35
Closure of a Set of FunctionalClosure of a Set of Functional
DependenciesDependencies Given a set F set of functional dependencies, there are certain other
functional dependencies that are logically implied by F .
For example: If A B and B C , then we can infer that A C
The set of all functional dependencies logically implied by F is the closure of F .
We denote the closure of F by F + .
We can find all of F+ by applying Armstrong’s Axioms:
if , then (reflexivity)
if , then (augmentation)
if , and , then (transitivity) These rules are
sound (generate only functional dependencies that actually hold) and
complete (generate all functional dependencies that hold).
7.36
ExampleExample
R = (A, B, C, G, H, I) F = { A B
A C CG H CG I
B H }
some members of F +
A H
by transitivity from A B and B H
AG I
by augmenting A C with G, to get AG CGand then transitivity with CG I
CG HI
by augmenting CG I to infer CG CGI,
and augmenting of CG H to infer CGI HI,
and then transitivity
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 19/42
19
7.37
Procedure for Computing FProcedure for Computing F++
To compute the closure of a set of functional dependencies F:
F + = F repeat
for each functional dependency f in F +
apply reflexivity and augmentation rules on f add the resulting functional dependencies to F +
for each pair of functional dependencies f 1and f 2 in F +
if f 1 and f 2 can be combined using transitivitythen add the resulting functional dependency to F +
until F + does not change any further
NOTE: We shall see an alternative procedure for this task later
7.38
Closure of Functional DependenciesClosure of Functional Dependencies(Cont.)(Cont.)
We can further simplify manual computation of F + by using thefollowing additional rules.
If holds a nd holds, then holds (union)
If holds, then holds and holds(decomposition)
If holds a nd holds, then holds(pseudotransitivity)
The above rules can be inferred from Armstrong’s axioms.
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 20/42
20
7.39
Closure of Attribute SetsClosure of Attribute Sets
Given a set of attributes define the closure of under F (denoted by+) as the set of attributes that are functionally determined by underF
Algorithm to compute +, the closure of under F
result := ;while (changes to result ) do
for each in F dobegin
if result then result := result end
7.40
Example of Attribute Set ClosureExample of Attribute Set Closure
R = (A, B, C, G, H, I)
F = {A B A CCG H CG I B H }
(AG) +
1. result = AG
2. result = ABCG (A C and A B) 3. result = ABCGH (CG H and CG AGBC)
4. result = ABCGHI (CG I and CG AGBCH)
Is AG a candidate key?
1. Is AG a super key?
1. Does AG R? == Is (AG)+ R
2. Is any subset of AG a superkey?
1. Does A R ? == Is (A)+ R
2. Does G R ? == Is (G)+ R
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 21/42
21
7.41
Uses of Attribute ClosureUses of Attribute ClosureThere are several uses of the attribute closure algorithm:
Testing for superkey:
To test if is a superkey, we compute +, and check if + containsall attributes of R .
Testing functional dependencies
To check if a functional dependency holds (or, in otherwords, is in F +), just check if +.
That is, we compute + by using attribute closure, and then checkif it contains .
Is a simple and cheap test, and very useful Computing closure of F
For each R, we find the closure +, and for each S +, weoutput a functional dependency S.
7.42
Canonical CoverCanonical Cover
Sets of functional dependencies may have redundant dependenciesthat can be inferred from the others
For example: A C is redundant in: {A B , B C }
Parts of a functional dependency may be redundant
E.g.: on RHS: {A B , B C , A CD } can be simplifiedto
{A B , B C , A D }
E.g.: on LHS: {A B , B C , AC D } can be simplifiedto
{A B , B C , A D }
Intuitively, a canonical cover of F is a “minimal” set of functionaldependencies equivalent to F, having no redundant dependencies orredundant parts of dependencies
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 22/42
22
7.43
Extraneous AttributesExtraneous Attributes
Consider a set F of functional dependencies and the functionaldependency in F .
Attribute A is extraneous in if A and F logically implies (F – { }) {( – A) }.
Attribute A is extraneous in if A and the set of functional dependencies(F – { }) { ( – A)} logically implies F.
Note: implication in the opposite direction is trivial in each of thecases above, since a “stronger” functional dependency alwaysimplies a weaker one
Example: Given F = {A C , AB C } B is extraneous in AB C because {A C, AB C } logically
implies A C (I.e. the result of dropping B from AB C ).
Example: Given F = {A C , AB CD}
C is extraneous in AB CD since AB C can be inferred evenafter deleting C
7.44
Testing if an Attribute is ExtraneousTesting if an Attribute is Extraneous
Consider a set F of functional dependencies and the functionaldependency in F .
To test if attribute A is extraneous in
1. compute ({} – A)+ using the dependencies in F
2. check that ({} – A)+ contains ; if it does, A is extraneous in
To test if attribute A is extraneous in
1. compute + using only the dependencies in
F’ = (F – { }) { ( – A)},
2. check that + contains A; if it does, A is extraneous in
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 23/42
23
7.45
Canonical CoverCanonical Cover
A canonical cover for F is a set of dependencies F c such that
F logically implies all dependencies in F c, and
F c logically implies all dependencies in F, and
No functional dependency in F c contains an extraneous attribute, and
Each left side of functional dependency in F c is unique.
To compute a canonical cover for F :repeat
Use the union rule to replace any dependencies in F 1 1 and 1 2 with 1 1 2
Find a functional dependency with an
extraneous attribute either in or in If an extraneous attribute is found, delete it from until F does not change
Note: Union rule may become applicable after some extraneous attributeshave been deleted, so it has to be re-applied
7.46
Computing a Canonical CoverComputing a Canonical Cover
R = (A, B, C) F = {A BC
B C A B
AB C }
Combine A BC and A B into A BC
Set is now {A BC, B C, AB C }
A is extraneous in AB C
Check if the result of deleting A from AB C is implied by the otherdependencies
Yes: in fact, B C is already present!
Set is now {A BC, B C }
C is extraneous in A BC
Check if A C is logically implied by A B and the other dependencies
Yes: using transitivity on A B and B C.
– Can use attribute closure of A in more complex cases
The canonical cover is: A B B C
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 24/42
24
7.47
LosslessLossless--join Decompositionjoin Decomposition
For the case of R = (R 1, R 2), we require that for all possiblerelations r on schema R
r = R1 (r ) R2 (r )
A decomposition of R into R 1 and R 2 is lossless join if andonly if at least one of the following dependencies is in F +:
R 1 R 2 R 1
R 1 R 2 R 2
7.48
ExampleExample
R = (A, B, C) F = {A B, B C)
Can be decomposed in two different ways
R 1 = (A, B), R 2 = (B, C)
Lossless-join decomposition:
R 1 R 2 = {B } and B BC
Dependency preserving
R 1 = (A, B), R 2 = (A, C)
Lossless-join decomposition:
R 1 R 2 = {A} and A AB
Not dependency preserving(cannot check B C without computing R 1 R 2)
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 26/42
26
7.51
ExampleExample
R = (A, B, C )F = {A B
B C }Key = {A}
R is not in BCNF
Decomposition R 1 = (A, B), R 2 = (B, C)
R 1 and R 2 in BCNF
Lossless-join decomposition
Dependency preserving
7.52
Testing for BCNFTesting for BCNF
To check if a non-trivial dependency causes a violation of BCNF
1. compute + (the attribute closure of ), and
2. verify that it includes all attributes of R , that is, it is a superkey of R .
Simplified test: To check if a relation schema R is in BCNF, it suffices tocheck only the dependencies in the given set F for violation of BCNF,rather than checking all dependencies in F +.
If none of the dependencies in F causes a violation of BCNF, thennone of the dependencies in F + will cause a violation of BCNF either.
However, using only F is incorrect when testing a relation in adecomposition of R
Consider R = (A, B, C, D, E ), with F = { A B, BC D }
Decompose R into R 1 = (A,B ) and R 2 = (A,C,D, E )
Neither of the dependencies in F contain only attributes from(A,C,D,E ) so we might be mislead into thinking R 2 satisfies BCNF.
In fact, dependency AC D in F + shows R 2 is not in BCNF.
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 27/42
27
7.53
Testing Decomposition for BCNFTesting Decomposition for BCNF
To check if a relation R i in a decomposition of R is in BCNF,
Either test Ri for BCNF with respect to the restriction of F to Ri (thatis, all FDs in F+ that contain only attributes from Ri)
or use the original set of dependencies F that hold on R , but with thefollowing test:
– for every set of attributes R i , check that + (the attributeclosure of ) either includes no attribute of R i - , or includes allattributes of R i .
If the condition is violated by some in F , the dependency (+ - ) R i
can be shown to hold on R i , and R i violates BCNF.We use above dependency to decompose R i
7.54
BCNF Decomposition AlgorithmBCNF Decomposition Algorithm
result := {R };done := false;compute F +;while (not done) do
if (there is a schema R i in result that is not in BCNF)then begin
let be a nontrivial functional dependency that holds on R i such that R i is not in F +,
and = ;result := (result – R i ) (R i – ) (, ); end
else done := true;
Note: each R i is in BCNF, and decomposition is lossless-join.
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 28/42
28
7.55
Example of BCNF DecompositionExample of BCNF Decomposition
R = (A, B, C )F = {A B
B C }Key = {A}
R is not in BCNF (B C but B is not superkey)
Decomposition
R 1 = (B, C)
R 2 = (A,B)
7.56
Example of BCNF DecompositionExample of BCNF Decomposition
Original relation R and functional dependency F
R = (branch_name, branch_city, assets,
customer_name, loan_number, amount )
F = {branch_name assets branch_city
loan_number amount branch_name }
Key = {loan_number, customer_name }
Decomposition R 1 = (branch_name, branch_city, assets )
R 2 = (branch_name, customer_name, loan_number, amount )
R 3 = (branch_name, loan_number, amount )
R 4 = (customer_name, loan_number )
Final decompositionR 1, R 3, R 4
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 29/42
29
7.57
BCNF and Dependency PreservationBCNF and Dependency Preservation
R = (J, K, L )F = {JK L
L K }Two candidate keys = JK and JL
R is not in BCNF
Any decomposition of R will fail to preserve
JK L
This implies that testing for JK L requires a join
It is not always possible to get a BCNF decomposition that isdependency preserving
7.58
Third Normal Form: MotivationThird Normal Form: Motivation
There are some situations where
BCNF is not dependency preserving, and
efficient checking for FD violation on updates is important
Solution: define a weaker normal form, called ThirdNormal Form (3NF)
Allows some redundancy (with resultant problems; we willsee examples later)
But functional dependencies can be checked on individualrelations without computing a join.
There is always a lossless-join, dependency-preservingdecomposition into 3NF.
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 30/42
30
7.59
3NF Example3NF Example
Relation R:
R = (J, K, L )F = {JK L, L K }
Two candidate keys: JK and JL
R is in 3NF
JK L JK is a superkeyL K K is contained in a candidate key
7.60
Redundancy in 3NFRedundancy in 3NF
J
j 1
j 2 j 3
null
L
l 1
l 1l 1
l 2
K
k 1
k 1k 1
k 2
repetition of information (e.g., the relationship l 1, k 1)
need to use null values (e.g., to represent the relationshipl 2, k 2 where there is no corresponding value for J ).
There is some redundancy in this schema
Example of problems due to redundancy in 3NF
R = (J, K, L) F = {JK L, L K }
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 32/42
32
7.63
3NF Decomposition Algorithm (Cont.)3NF Decomposition Algorithm (Cont.)
Above algorithm ensures:
each relation schema R i is in 3NF
decomposition is dependency preserving and lossless-join
Proof of correctness is at end of this presentation (click here)
7.64
3NF Decomposition: An Example3NF Decomposition: An Example
Relation schema:
cust_banker_branch = (customer_id, employee_id, branch_name, type )
The functional dependencies for this relation schema are:
1. customer_id, employee_id branch_name, type
2. employee_id branch_name
3. customer_id, branch_name employee_id
We first compute a canonical cover branch_name is extraneous in the r.h.s. of the 1st dependency
No other attribute is extraneous, so we get FC =
customer_id, employee_id type employee_id branch_name customer_id, branch_name employee_id
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 33/42
33
7.65
3NF3NF DecompsitionDecompsition Example (Cont.)Example (Cont.)
The for loop generates following 3NF schema:
(customer_id, employee_id, type )
(employee_id, branch_name )
(customer_id, branch_name, employee_id)
Observe that (customer_id, employee_id, type ) contains a candidate key ofthe original schema, so no further relation schema needs be added
If the FDs were considered in a different order, with the 2nd one considered afterthe 3rd,
(employee_id, branch_name )would not be included in the decomposition because it is a subset of
(customer_id, branch_name, employee_id)
Minor extension of the 3NF decomposition algorithm: at end of for loop, detectand delete schemas, such as (employee_id, branch_name ), which are subsetsof other schemas
result will not depend on the order in which FDs are considered
The resultant simplified 3NF schema is:
(customer_id, employee_id, type )
(customer_id, branch_name, employee_id)
7.66
Comparison of BCNF and 3NFComparison of BCNF and 3NF
It is always possible to decompose a relation into a set of relationsthat are in 3NF such that:
the decomposition is lossless
the dependencies are preserved
It is always possible to decompose a relation into a set of relationsthat are in BCNF such that:
the decomposition is lossless
it may not be possible to preserve dependencies.
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 34/42
34
7.67
Design GoalsDesign Goals
Goal for a relational database design is:
BCNF.
Lossless join.
Dependency preservation.
If we cannot achieve this, we accept one of
Lack of dependency preservation
Redundancy due to use of 3NF
Interestingly, SQL does not provide a direct way of specifyingfunctional dependencies other than superkeys.
Can specify FDs using assertions, but they are expensive to test
Even if we had a dependency preserving decomposition, using SQLwe would not be able to efficiently test a functional dependency whoseleft hand side is not a key.
7.68
Multivalued Dependencies (Multivalued Dependencies (MVDsMVDs))
Let R be a relation schema and let R and R. Themultivalued dependency
holds on R if in any legal relation r(R), for all pairs for tuples t 1and t 2 in r such that t 1[] = t 2 [], there exist tuples t 3 and t 4 inr such that:
t 1[] = t 2 [] = t 3 [] = t 4 []
t 3[] = t 1 []t 3[R – ] = t 2[R – ]t 4 [] = t 2[]t 4[R – ] = t 1[R – ]
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 35/42
35
7.69
MVD (Cont.)MVD (Cont.)
Tabular representation of
7.70
ExampleExample
Let R be a relation schema with a set of attributes that are partitionedinto 3 nonempty subsets.
Y, Z, W
We say that Y Z (Y multidetermines Z )if and only if for all possible relations r (R )
< y 1, z 1, w 1 > r and < y 1, z 2, w 2 > r
then
< y 1, z 1, w 2 > r and < y 1, z 2, w 1 > r
Note that since the behavior of Z and W are identical it follows that
Y Z if Y W
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 36/42
36
7.71
Example (Cont.)Example (Cont.)
In our example:
course teachercourse book
The above formal definition is supposed to formalize thenotion that given a particular value of Y (course ) it hasassociated with it a set of values of Z (teacher) and a set ofvalues of W (book) , and these two sets are in some senseindependent of each other.
Note:
If Y Z then Y Z
Indeed we have (in above notation) Z 1 = Z 2The claim follows.
7.72
Use of Multivalued DependenciesUse of Multivalued Dependencies
We use multivalued dependencies in two ways:
1. To test relations to determine whether they are legal under agiven set of functional and multivalued dependencies
2. To specify constraints on the set of legal relations. We shallthus concern ourselves only with relations that satisfy agiven set of functional and multivalued dependencies.
If a relation r fails to satisfy a given multivalued dependency, we
can construct a relations r
that does satisfy the multivalueddependency by adding tuples to r.
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 37/42
37
7.73
Theory ofTheory of MVDsMVDs
From the definition of multivalued dependency, we can derive thefollowing rule:
If , then
That is, every functional dependency is also a multivalueddependency
The closure D+ of D is the set of all functional and multivalueddependencies logically implied by D .
We can compute D+ from D , using the formal definitions offunctional dependencies and multivalued dependencies.
We can manage with such reasoning for very simple multivalued
dependencies, which seem to be most common in practice
For complex dependencies, it is better to reason about sets ofdependencies using a system of inference rules (see Appendix C).
7.74
Fourth Normal FormFourth Normal Form
A relation schema R is in 4NF with respect to a set D of functional andmultivalued dependencies if for all multivalued dependencies in D + ofthe form , where R and R, at least one of the followinghold:
is trivial (i.e., or = R)
is a superkey for schema R
If a relation is in 4NF it is in BCNF
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 38/42
38
7.75
Restriction ofRestriction of MultivaluedMultivalued DependenciesDependencies
The restriction of D to Ri is the set Di consisting of
All functional dependencies in D+ that include only attributes of Ri
All multivalued dependencies of the form
( Ri)
where Ri and is in D+
7.76
4NF Decomposition Algorithm4NF Decomposition Algorithm
result: = {R };done := false;compute D +;Let Di denote the restriction of D+ to Ri
while (not done )if (there is a schema Ri in result that is not in 4NF) then
begin
let be a nontrivial multivalued dependency that holds
on R i such that R i is not in D i, and ;result := (result - R i ) (R i - ) (, );
endelse done := true;
Note: each R i is in 4NF, and decomposition is lossless-join
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 39/42
39
7.77
ExampleExample
R =(A, B, C, G, H, I )
F ={ A B
B HI
CG H }
R is not in 4NF since A B and A is not a superkey for R
Decomposition
a) R 1 = (A, B ) (R 1 is in 4NF)
b) R 2 = (A, C, G, H, I ) (R 2 is not in 4NF)
c) R 3 = (C, G, H ) (R 3 is in 4NF)d) R 4 = (A, C, G, I ) (R 4 is not in 4NF)
Since A B and B HI , A HI , A I
e) R 5 = (A, I ) (R 5 is in 4NF)
f)R 6 = (A, C, G) (R6 is in 4NF)
7.78
Further Normal FormsFurther Normal Forms
Join dependencies generalize multivalued dependencies
lead to project-join normal form (PJNF) (also called fifth normalform)
A class of even more general constraints, leads to a normal formcalled domain-key normal form.
Problem with these generalized constraints: are hard to reason with,and no set of sound and complete set of inference rules exists.
Hence rarely used
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 40/42
40
7.79
Overall Database Design ProcessOverall Database Design Process
We have assumed schema R is given
R could have been generated when converting E-R diagram to a set oftables.
R could have been a single relation containing all attributes that are ofinterest (called universal relation).
Normalization breaks R into smaller relations.
R could have been the result of some ad hoc design of relations, whichwe then test/convert to normal form.
7.80
ER Model and NormalizationER Model and Normalization
When an E-R diagram is carefully designed, identifying all entitiescorrectly, the tables generated from the E-R diagram should not needfurther normalization.
However, in a real (imperfect) design, there can be functionaldependencies from non-key attributes of an entity to other attributes ofthe entity
Example: an employee entity with attributes department_number and department_address , and a functional dependency
department_number department_address
Good design would have made department an entity
Functional dependencies from non-key attributes of a relationship setpossible, but rare --- most relationships are binary
8/13/2019 3 Data Base Design
http://slidepdf.com/reader/full/3-data-base-design 41/42
41
7.81
DenormalizationDenormalization for Performancefor Performance
May want to use non-normalized schema for performance
For example, displaying customer_name along with account_number andbalance requires join of account with depositor
Alternative 1: Use denormalized relation containing attributes of account as well as depositor with all above attributes
faster lookup
extra space and extra execution time for updates
extra coding work for programmer and possibility of error in extra code
Alternative 2: use a materialized view defined as
account depositor Benefits and drawbacks same as above, except no extra coding work
for programmer and avoids possible errors
7.82
Other Design IssuesOther Design Issues
Some aspects of database design are not caught by normalization
Examples of bad database design, to be avoided:
Instead of earnings (company_id, year, amount ), use
earnings_2004, earnings_2005, earnings_2006 , etc., all on theschema (company_id, earnings ).
Above are in BCNF, but make querying across years difficultand needs new table each year
company_year (company_id, earnings_2004, earnings_2005,earnings_2006 )
Also in BCNF, but also makes querying across years difficultand requires new attribute each year.
Is an example of a crosstab, where values for one attributebecome column names
Used in spreadsheets, and in data analysis tools