Consider the following relational schema: violations(VID BID SNu SNa Zip InD Bor BoI NVI NVD). (Abbreviations for Violation ID, Building ID, Street Number, Street Name, Zip Code, Inspection Date, Borough, Boro ID, Notice of Violation ID, Notice of Violation Description) Assume the following functional dependencies hold on violations. VID → BID SNu SNa Zip InD Bor BoI NVI NVD BID → SNu SNa Zip Bor BoI NVI → NVD NVD → NVI Bor → BoI BoI → Bor SNu SNa Zip → Bor 1.Show a decomposition of violations into normal form. Show each step in your decomposition and the primary key for each table. 2. Find a functional dependency in the original that does not correspond to a key in your normalized scheme. 3. Is it possible that a legal database instance d (one that satisfies all keys) on your normalized scheme violates the functional dependency in question 9 in the sense that if you join all the relations in d together, the result r violates the functional dependency? Explain why or why not.
Consider the following relational schema:
violations(VID BID SNu SNa Zip InD Bor BoI NVI NVD).
(Abbreviations for Violation ID, Building ID, Street Number, Street Name, Zip Code, Inspection Date, Borough, Boro ID, Notice of Violation ID, Notice of Violation Description)
Assume the following functional dependencies hold on violations.
VID → BID SNu SNa Zip InD Bor BoI NVI NVD
BID → SNu SNa Zip Bor BoI
NVI → NVD
NVD → NVI
Bor → BoI
BoI → Bor
SNu SNa Zip → Bor
1.Show a decomposition of violations into normal form. Show each step in your decomposition and the primary key for each table.
2. Find a functional dependency in the original that does not correspond to a key in your normalized scheme.
3. Is it possible that a legal
Trending now
This is a popular solution!
Step by step
Solved in 6 steps
Correction in question 3
3. Is it possible that a legal
by Bartleby Expert
