Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
25Activity
0 of .
Results for:
No results containing your search query
P. 1
Database Normalization

Database Normalization

Ratings:

5.0

(3)
|Views: 1,651|Likes:
Published by Arnav Guddu
Database Normalization
Database Normalization

More info:

Categories:Types, Research, Science
Published by: Arnav Guddu on Jul 17, 2009
Copyright:Traditional Copyright: All rights reserved

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as DOC, PDF, TXT or read online from Scribd
See more
See less

08/04/2013

pdf

text

original

 
 Normalization
Constraints: There are 2 types of constraints:1)Defines the permitted values, the attributes can have.2)Defines the relationship between the attribute.Functional Dependency (FD): It is denoted by
. FD X
Y means that Xuniquely determines Y, where X and Y are simple or composite attributes. The dependency from X to Y is said to be there if application has thefollowing:If T1 and T2 are 2 tuples with some values X then value for Y must also besame in T1 and T2 i.e., relationship between X and Y is independent of otherattributes which must be present in the table. In simple words, for a given Xthere is always a single value of Y.For example,
A Street of a City
Pin Code: A Street of a city has a uniquepin code however the reverse need not be true.
(ISBN, TITLE)
AUTHOR: Given an ISBN number, one can findthe Title and name of the Author of the book. Implications and Covers: The application can call for some functionaldependencies which may imply additional functional dependencies.If F is the set of FDs then we define closure of F denoted as F+ to be set of allpossible FDs, which is implied by F. To find F+, given F, we have to find out the interface rules for the FD’s whichare implied by F. The inference rules are very important for good databasedesign for the following reasons:
Given F, one may like to determine whether X
 Y is implied or not.
For computing the closure of F+ of F.
1
|
PageWritten By Arnav MukhopadhyayEMAIL:ARNAV.MUKHOPADHYAY@smude.edu.in 
 
Given F we may want to remove those FDs, which are redundant in F. AFD is redundant if it is implied by another FD in F.While designing database schema:
Find minimal cover of “G” of F.By finding minimal cover, G does not contain any redundant FDs(that is, G+ will be same as F+). By computing minimal cover G of F, we can ensure that DBMS will enforce the constraints, whichautomatically enforces the constraints implied by G.Inference rules for FDs:Inference rules are known as Armstrong’s Axioms, are published byArmstrong. These properties are as given below:
1.
Reflexive property: X
Y is TRUE, if Y is a SUBSET of X.
2.
Augmentation property: If X
Y is TRUE, then XZ
YZ is also TRUE.
3.
 Transitivity property: If X
Y and Y
Z are TRUE, then X
Z isimplied.
4.
Union property: If X
Y and X
Z are TRUE, then X
YZ is also TRUE. This property indicates that if Right Hand Side of FD containsmany attributes then, FD exists for each of them.
5.
Decomposition property: If X
Y is implied and Z is a SUBSET of Y,the X
Z is implied. This property is the Reverse of Union property.
6.
Pseudo transitivity property: If X
Y and WY
Z are given, thenXW
Z is TRUE.Example: Consider a college having a table STUDY with COURSE, TEACHER, ROOM NO and DEPARTMENT as attributes.STUDY (COURSE, TEACHER, ROOMNO, DEPT) here identify few FDsnamely:
Course
Teacher
 Teacher
Department
Course
Room Number
2
|
PageWritten By Arnav MukhopadhyayEMAIL:ARNAV.MUKHOPADHYAY@smude.edu.in
 
Additional FDs can be derived from above by using Inferenceproperties:
By reflexivity: (Course, Teacher)
Teacher
By Augmentation: (Course, Room Number)
(Teacher, RoomNumber)
By Transitivity: Course
Department
By Union: Course
(Teacher, Room Number) The main axioms of Armstrong are sound and complete, and aredefined as:
1.
Soundness property: If X
Y can be inferred from F using theabove axioms, the X
Y will be TRUE in any relation in which Fholds.
2.
Completeness property: If X
Y cannot be inferred from F and Fholds in relation R, then X
Y will not be TRUE in relation R.
3
|
PageWritten By Arnav MukhopadhyayEMAIL:ARNAV.MUKHOPADHYAY@smude.edu.in

Activity (25)

You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
trskaran liked this
rajaramansuresh liked this
bbmrose liked this
hitk liked this
prasanna.parre liked this
yuakeem liked this
giet510 liked this

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->