Enrollment No. : 01215901713 Subject : Database Management Systems Topic : Normal Forms Subject Code : BBA- 106 Semester : BBA II Batch : 2013 2016
(Instructor: Ms. Jyoti Gupta) ASSIGNMENT QUESTION
SOLUTI ON Normal forms The normal forms are based on FDs are first normal forms (1NF), second normal forms (2NF) third normal forms (3NF), and boyce-Codd normal forms (BCNF). These forms have increasingly restrictive requirements: Every relation in BCNF is also in 3NF, every relation in 3NF is also in 2NF and every relation in 2NFis in 1NF. A relation is in first normal form is every field contains only atomic values that is, no list or sets. This requirement is implict in our defination of the relational model. Although some of the newer database system are relaxing this requirement. 2NF is mainly of historical interest. 3NF and BCNF are important from a database design standpoint.
What are FDs? FDs are probably the most common and important kind of constant from the point of view of database design. There are several other kinds of dependencies multivalued dependencies and join dependencies. Boycee-Codd Normal Forms (BCNF) Let R be a relation schema, F be the set of FDs given to hold over R,X be a subset of the attribute of R and A be an attribute of R.R is in Boyce-codd normal forms. In a BCNF relation, the only nontrivial dependencies are those in which a key determines some attribute(s). Each tuple can be thought of as an entity or relationship , Identified by a key and described by the remaining attributes. Each attribute must describe [an entity of relationship, identified by] the key, the whole key, and nothing but the key. If there are several candidate keys, each candidate key can play the role of KEY with the other attributes being the ones not in the chosen candidate key. BCNF ensures that no redundancy can be detected using FD information alone. It is thus the most desirable normal form if we take into accountant only FD information. X Y A x y 1 a x Y 2 ?
This figure shows (two tuples in) an instance of a relation with three attributes X,Y and A. There are two tuples with the same value in the X column. Now suppose that we know that this instance satisfies an FD X A. One of the tuples has the value a in the A column.
FIRST NORMAL FORMS 1NF A relation R is in first normal form (1NF) if and only if all underlying domains contain atomic values only EXAMPLE 1NF but not 2NF FIRST (supplier_no, status, city, part_no, quantity)
SECOND NORMAL FORM (2NF) 2NF A relation R is in second normal form (2NF) if and only if it is in 1NF and every non-key attribute is fully dependent on the primary key EXAMPLE (2NF but not 3NF) SECOND (supplier_no, status, city) THIRD NORMAL FORM (3NF) The third normal form is similar to that of BCNF , with the only difference being the third condition. Every BCNF relation is also in 3NF. A key of relation is a minimal set of attributes that unequally determines all other attributes. The motivation for 3NFha is rather technical. By making an exception for certain dependencies involving key attributes, we can ensure that every relation schema can be decomposed into a collection of 3NF relations using only decompositions that have certain desirable properties. The 3NF definition weakens the BCNF requirement just enough to make this gurantee possible. Unlike BCNF some redundancy is possible with 3NF.
EXAMPLE: (3NF but not BCNF) SUPPLIER_PART (supplier_no, supplier_name, part_no, quantity)
Plagiarism Report For 'DBMS.docx' Location Title Words Match ed Matc h (%) Uniqu e Words Match ed Uniq ue Matc h (%) http://defiant.yk.psu.edu/~lxn/IST_210/normal_form_defi nitions.html Normal Form Definitions & Examples - Penn State York Home Page 72 12 72 12 http://psoug.org/reference/normalization.html Oracle Normalizat ion Normal Form 1st 2nd 3rd 4th 5th 21 3 0 <1 http://www.cs.sjsu.edu/faculty/lee/cs157b/CS157BL64th NF.ppt Chapter 7: Relational 22 4 22 4 Location Title Words Match ed Matc h (%) Uniqu e Words Match ed Uniq ue Matc h (%) Database Design - San Jose State University http://www.scribd.com/doc/125781623/266/Third- Normal-Form 15.5.2 Third Normal Form for Dbms by Raghu Ramakrish nan 76 13 55 9 http://www.cs.sjsu.edu/faculty/lee/cs157b/28SpCS157BM id3Revision.ppt Earthquake Prediction Methods - San Jose State University 37 6 37 6 http://www.databasedesign-resource.com/normal- forms.html The 5 Normal forms in Database Design 38 6 0 <1 http://www.cs.sjsu.edu/faculty/lee/cs157b/21SCS157BL6 FDSQL.ppt Chapter 7: Relational Database Design - Departmen t of ... 30 5 0 <1 http://www.slideshare.net/arnold7490/unit05-dbms- 9940744 Unit05 dbms - SlideShare 85 14 74 12 Matching Content: 35% Master Document Text BBA II - RESEARCH ASSIGNMENTName : Rahul ChaudharyEnrollment No. : 01215901713Subject : Database BBA- 106Semester : BBA II Batch : 2013 - 2016 (Instructor: Ms. Jyoti forms The normal forms are based on FDs are first normal forms (1NF), second normal forms (2NF) third normal forms (3NF), and boyce-Codd normal forms BCNF). These forms have increasingly restrictive requirements: Every relation in BCNF is also in 3NF, every relation in 3NF is also in 2NF and every relation in 2NFis in 1NF. A relation is in first normal form is every field contains only atomic values that is, no list or sets. This requirement is implict in our defination of the relational model. Although some of the newer database system are relaxing this requirement. 2NF is mainly of historical interest. 3NF and BCNF are important from a database design standpoint.What are FDs?FDs are probably the most common and important kind of constant from the point of view of database design. There are several other kinds of dependencies multivalued dependencies and join Boycee-Codd Normal Forms (BCNF)Let R be a relation schema, F be the set of FDs given to hold over R,X be a subset of the attribute of R and A be an attribute of R.R is in Boyce-codd normal forms.In a BCNF relation, the only nontrivial dependencies are those in which a key determines some attribute(s). Each tuple can be thought of as an entity or relationship , Identified by a key and described by the remaining attributes. attribute must describe [an entity of relationship, identified by] the key, the whole key, and nothing but the key. If there are several candidate keys, each candidate key can play the role of KEY with the other attributes being the ones not in the chosen candidate key. BCNF ensures that no redundancy can be detected using FD information alone. It is thus the most desirable normal form if we take into accountant only FD information. X A x y1 a x Y2 ?This figure shows (two tuples in) an instance of a relation with three attributes X,Y and A. There are two tuples with the same value in the X column. Now suppose that we know that this instance satisfies an FD X A. One of the tuples has the value a in the A column.FIRST FORMS1NF A relation R is in first normal form (1NF) if and only if all underlying domains contain atomic values onlyEXAMPLE1NF but not 2NFFIRST supplier_no, status, city, part_no, quantity)SECOND NORMAL FORM (2NF)2NF A relation R is in second normal form (2NF) if and only if it is in 1NF and every non-key attribute is fully dependent on the primary keyEXAMPLE(2NF but not 3NF)SECOND (supplier_no, status, city)THIRD NORMAL FORM (3NF)The third normal form is similar to that of BCNF , with the only difference being the third condition. Every BCNF relation is also in 3NF. A key relation is a minimal set of attributes that unequally determines all other attributes.The motivation for 3NFha is rather technical. By making an exception for certain dependencies involving key attributes, we can ensure that every relation schema can be decomposed into a collection of 3NF relations using only decompositions that have certain desirable properties. The 3NF definition weakens the BCNF requirement just enough to make this gurantee possible. Unlike BCNF some redundancy is possible with 3NF.EXAMPLE: (3NF but not BCNF)SUPPLIER_PART (supplier_no, supplier_name, part_no quantity