Use Armstrong's axioms to prove the soundness of the pseudo-transitivity rule.

Subject Database Management System
Institute Ahsanullah Institute of Information and Communication Technology 2015

1. Use Armstrong's axioms to prove the soundness of the pseudo-transitivity rule.

Consider the relation schema R = (N, Y, P, M, C) and assume that the following set of functional dependencies hold on

R: F = { N → M, NY → P, M → C}

The letters can be interpreted as follows: R = (Model_Number, Year, Price, Manufacturing_Plant, Color).

2. Evaluate each of the following as a candidate key for R, giving reasons why it can or cannot be a key: N, NY, NC.

 

Login to post your comment.