In the BCNF decomposition algorithm, suppose you use a functional dependency to decompose a relation schema r ( , ,

• In the BCNF decomposition algorithm, suppose you use a functional dependency α → β to decompose a relation schema r ( α , β , γ ) into r1 (α , β ) and r2 ( α , γ ).

1. What primary and foreign-key constraint do you expect to hold on the decomposed relations?
2. Give an example of an inconsistency that can arise due to an erroneous update, if the foreign-key constraint were not enforced on the decomposed relations above.
3. When a relation is decomposed into 3NF, what primary and foreign key dependencies would you expect will hold on the decomposed schema?