Define 2nf normal form, Database Management System

2NF Normal Form:

A relation schema process R is in 2NF if it is in 1NF and each non-prime attribute A in R is fully functionally related on primary key. Second normal form (2NF) is a normal process needed in database normalization. 2NF was originally described by E.F. Codd in 1971. A table that is in first normal form (1NF) must accept additional criteria if it is to accept for second normal form. A table is in 2NF if and only if, it is in 1NF and no non prime attribute is related on any proper subset of any candidate key of the table.

 

1801_2 NF Normal Form.png

Posted Date: 7/30/2012 2:11:33 AM | Location : United States







Related Discussions:- Define 2nf normal form, Assignment Help, Ask Question on Define 2nf normal form, Get Answer, Expert's Help, Define 2nf normal form Discussions

Write discussion on Define 2nf normal form
Your posts are moderated
Related Questions
Limitations of File Based System The file-based system has some limitations. The limitations are listed as follows: Isolation and separation of data: When the data is

what is difference between circular inked lust and grunded linked list

Insulation between conceptual and physical structures It can be defined as: 1. The Database Administrator should be capable to vary the storage structures without affectin

Differentiate between the object oriented decomposition and the structured decomposition? Process-oriented (structural) decomposition divides a complex process, function or tas

what is bogus empowerment. And what is genuine empowerment

Which of the operations constitute a basic set of operations for manipulating relational data? Relational algebra operations constitute a basic set of operations for manipulati

Describe the Association: Design  Before we describe association design let us define association "Association is set of links between two objects in the object model". It is

HOW TO SOLVE THE LP Problems by simplex method?z=x1+-3x2+2x3

What are the disadvantages of file-processing system?  Ans: The Disadvantages of File-Processing System a. Data redundancy and inconsistency - Data redundancy means not nece

How does a query tree represent a relational algebra expression?      Ans: This includes transforming an initial expression (tree) into an equivalent expression (tree) that is