Question: Consider the universal relation schema INVENTORY (Store#, Item, Vendor, Date, Cost, Units, Manager, Price, Sale, Size, Color, Location) and the constraint set F {fd1, fd2,

Consider the universal relation schema INVENTORY (Store#, Item, Vendor, Date, Cost, Units, Manager, Price, Sale, Size, Color, Location) and the constraint set F {fd1, fd2, fd3, fd4, fd5, fd6, fd7} where:
Consider the universal relation schema INVENTORY (Store#, Item, Vendor, Date,

a. Do the functional dependencies shown constitute a minimal cover of F? If not, do they derive a minimal cover?
b. Derive the candidate key(s) of URS using the synthesis approach.
c. Derive the candidate key(s) of URS by using the decomposition approach.

f31: {item. Vendor) fd2: {Store#, Date) (Manager, Sale) fd4: Manager-> Store# fd6: Item (Size, Color) Cost fd3: (Store#, Item, Date) fas: Cost Price Units fd7: Vendor Location

Step by Step Solution

3.34 Rating (160 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a The algorithm to compute the minimal cover for a given set of functional dependencies F is a Set G to F b Convert all FDs in G to standard canonical formie the right side dependent attribute of ever... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

887-CS-DB (2171).docx

120 KBs Word File

Students Have Also Explored These Related Databases Questions!