1. Consider the following table and FDs: USAGE(user-id, username, password, resource-id, type, name, location, access, permission)...

 

Transcribed Image Text:

1. Consider the following table and FDs: USAGE(user-id, username, password, resource-id, type, name, location, access, permission) user-id → username, password resource-id → type, name, location user-id, resource-id → permission location → access (a) Give all the keys of USAGE and its normal form. (b) Decompose USAGE into 3NF relations. Make sure the decomposition is lossless. Show only the final result of the decomposition. 2. Assume the following set of FDs: A → B, BC → D, D → E, B → C, A → D, B → E. (a) calculate the canonical/minimal cover. (b) For each simplified FD, show the reason it was simplified. (c) For each eliminated FD, show the reason it was eliminated. 1. Consider the following table and FDs: USAGE(user-id, username, password, resource-id, type, name, location, access, permission) user-id → username, password resource-id → type, name, location user-id, resource-id → permission location → access (a) Give all the keys of USAGE and its normal form. (b) Decompose USAGE into 3NF relations. Make sure the decomposition is lossless. Show only the final result of the decomposition. 2. Assume the following set of FDs: A → B, BC → D, D → E, B → C, A → D, B → E. (a) calculate the canonical/minimal cover. (b) For each simplified FD, show the reason it was simplified. (c) For each eliminated FD, show the reason it was eliminated.