Define 3nf normal form, Database Management System

Assignment Help:

3NF Normal Form

A relation schema R is in 3NF if it is in 2NF and for each FD X A either of the following is true

  • X is a Super-key of R.
  • A is a prime attribute of R.

In other words, if every non prime attribute is non-transitively related on primary key.

 

 

698_3 NF Normal Form.png


Related Discussions:- Define 3nf normal form

Key to represent relationship between tables is called, Key to represent re...

Key to represent relationship amongs tables is called ? A Key that represent the relationship between tables is called Foreign Key.

Design of a database, Ask questioYou are the database administrator in a un...

Ask questioYou are the database administrator in a university. You have been tasked to come up with a new database for the University. Using the stages in Database Life Cycle come

External failure-database recovery and security, External failure : A failu...

External failure : A failure can also result because of an external cause, such as earthquakes, fire, floods, etc. The database must be duly backed up to avoid troubles occurring d

Explain cascade and restrict clauses of drop schema command, Explain severa...

Explain several types of constraints that can be specified using CREATE TABLE command. Explain CASCADE and RESTRICT clauses of DROP SCHEMA command? Constraint Description PRIM

Determine the minimal set of functional dependencies, Determine the minimal...

Determine the minimal set of functional dependencies for the following data. This table is part of the OHSU database of extracurricular activities and tracks the DMICE band's co

Cartesian product, If R1 and R2 are two relations or functions, then the re...

If R1 and R2 are two relations or functions, then the result of R3 = R1 × R2 is the combination of tuples that are in R1 and R2. The product is associative and commutative. Degr

In tuple relational calculus p1- p2 is equivalent to, In tuple relational ...

In tuple relational calculus P1 → P2 is equivalent to ? A In tuple relational calculus P1→  P2 is equivalent to ¬P1 V P2. (The logical implication expression A  B, meaning

What are the desirable properties of a decomposition, Define What are the d...

Define What are the desirable properties of a decomposition Ans: What are the desirable properties of decomposition - dependency preserving.  Because Lossless join and dependen

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd