In the BCNF decomposition algorithm, suppose you use a functional dependency to decompose a
Fantastic news! We've Found the answer you've been seeking!
Question:
- In the BCNF decomposition algorithm, suppose you use a functional dependency α → β to decompose a relation schema r ( α , β , γ ) into r1 (α , β ) and r2 ( α , γ ).
- What primary and foreign-key constraint do you expect to hold on the decomposed relations?
- 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.
- When a relation is decomposed into 3NF, what primary and foreign key dependencies would you expect will hold on the decomposed schema?
Related Book For
Fundamentals Of Database Systems
ISBN: 9780133970777
7th Edition
Authors: Ramez Elmasri, Shamkant Navathe
Posted Date: