Computer Sciene of Udayana State University

April 26, 2009

Third Normal Form (3NF)

Filed under: Computer Science — ignaga @ 2:09 AM
  • Based on concept of transitive dependency:

A, B and C are attributes of a relation such that if A –> B and B –> C,

then C is transitively dependent on A through B. (Provided that A is not functionally dependent on B or C).

  • 3NF – A relation that is in 1NF and 2NF and in which no non-prime attribute is transitively dependent on the primary key.

Advertisements

Leave a Comment »

No comments yet.

RSS feed for comments on this post. TrackBack URI

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Create a free website or blog at WordPress.com.

%d bloggers like this: