Which normal form specifically eliminates transitive dependencies?

Get ready for your Fundamentals of Computing Test. Utilize flashcards and multiple-choice questions. Every question includes hints and explanations. Prepare effectively and ace your exam now!

Multiple Choice

Which normal form specifically eliminates transitive dependencies?

Explanation:
Transitive dependency involves a non-key attribute relying on another non-key attribute rather than directly on a key. This creates indirect pathways of dependency that can lead to update anomalies. Third Normal Form eliminates these by ensuring every non-prime attribute depends directly on a candidate key, not through another non-prime attribute. In practice, if you have a chain like key -> attribute B and B -> attribute C, then C would be transitively dependent on the key. To achieve 3NF, you decompose so that C’s dependency is on B within its own relation, removing the transitive path. That’s why this normal form is the one that specifically eliminates transitive dependencies. (BCNF also eliminates them but is stricter; 3NF is the standard level that targets this issue.)

Transitive dependency involves a non-key attribute relying on another non-key attribute rather than directly on a key. This creates indirect pathways of dependency that can lead to update anomalies. Third Normal Form eliminates these by ensuring every non-prime attribute depends directly on a candidate key, not through another non-prime attribute. In practice, if you have a chain like key -> attribute B and B -> attribute C, then C would be transitively dependent on the key. To achieve 3NF, you decompose so that C’s dependency is on B within its own relation, removing the transitive path. That’s why this normal form is the one that specifically eliminates transitive dependencies. (BCNF also eliminates them but is stricter; 3NF is the standard level that targets this issue.)

Subscribe

Get the latest from Examzify

You can unsubscribe at any time. Read our privacy policy