Question

In: Computer Science

Consider a relation R (ABCDEFGH) with the following functional dependencies: ACD --> EF AG --> A...

Consider a relation R (ABCDEFGH) with the following functional dependencies:

ACD --> EF

AG --> A

B --> CFH

D --> C

DF --> G

F --> C

F --> D

Find minimal cover and identify all possible candidate keys. In order to receive full credit, please list each step taken and the rules that you applied.

Solutions

Expert Solution

Solution:

Given,

=>Relation = R(ABCDEFGH)

=>Set of functional dependencies = {ACD -> EF, AG -> A, B -> CFH, D -> C, DF -> G, F -> C, F -> D}

Explanation:

Finding minimal cover:

Step 1:

=>Remove trivial functional dependencies.

=>AG -> A is a trivial fiunctional dependency so remove it.

=>Reduced functional dependencies set = {ACD -> EF, B -> CFH, D -> C, DF -> G, F -> C, F -> D}

Step 2:

=>Split functional dependencies such that right hand side contains only one attribute in each functional dependency.

=>Reduced functional dependencies set = {ACD -> E, ACD -> F, B -> C, B->F, B -> H, DF -> G, F -> C, F -> D}

Step 3:

=>Removing unused functional dependencies

=>functional dependency B -> C is unused because we can derive it using B -> F and F -> C.

=>Reduced functional dependencies set = {ACD -> E, ACD -> F, B->F, B -> H, DF -> G, F -> C, F -> D}

Step 4:

=>Removing extraneous attributes from the left hand side of the functional dependencies.

=>There is no extraneous attribute.

Step 5:

=>Combining functional dependencies

=>Reduced functional dependencies set = {ACD -> EF, B->FH, DF -> G, F -> CD}

=>Hence minimal cover = {ACD -> EF, B->FH, DF -> G, F -> CD}

Finding candidate keys:

=>There is no attributes "A" and "B" at the right hand side part of any of the given functional dependencies hence attributes "A" and "B" must be present in every candidate key as candidate key has ability to derive all the attributes of the relation.

=>(AB)+ = ABCDEFGH

=>Attribute closure of AB contains all the attributes of the relation hence AB is only the candidate key and if we include any other attribute with AB then it wil form super key.

=>Hence candidate key = {AB}

I have explained each and every part with the help of statements attached to the answer above.


Related Solutions

Consider the following relation R(A, B, C, D, E, G) and the set of functional dependencies...
Consider the following relation R(A, B, C, D, E, G) and the set of functional dependencies F={ A → BCD, BC → DE, B→D, D → A} Note: Show the steps for each answer. (a) Compute B+ . (b) Prove (using Armstrong’s axioms) that AG is superkey. (c) Compute Fc. (d) Give a 3NF decomposition of the given schema based on a canonical cover. (e) Give a BCNF decomposition of the given schema based on F. Use the first functional...
For the relation R(A,B,C,D,E) with the following Functional Dependencies: A → B, A → C, BC...
For the relation R(A,B,C,D,E) with the following Functional Dependencies: A → B, A → C, BC → D, AC → E, CE → A, list all non-trivial FDs following from the above.    Generate all possible keys for R. Check whether R is in 3NF. If it is in 3NF, explain the criteria you used. If it is not in 3NF, convert it into 3NF, showing the new relations and their FDs.
Normalization: Answer all 4 questions. You are given the following relation R and some functional dependencies....
Normalization: Answer all 4 questions. You are given the following relation R and some functional dependencies. R(SID, Project, Code, ListOfSupplies, Name, Initials, Abbrev) Project → ListOfSupplies SID → Name Name → Initials Project, Initials → Abbrev SID, Project → Code Code → SID Is R in 1NF? If not, normalize R into a collection of 1NF relations. Is R in 2NF? If not, normalize R (or your collection of 1NF relations) into a collection of 2NF relations. Is R in...
Consider a relation R with five attributes ABCDE. You are given the following dependencies: A à...
Consider a relation R with five attributes ABCDE. You are given the following dependencies: A à B, BC à E, and ED à A. (1) List all candidate keys for R. Please show your steps. (4 points) (2) Is R in 3NF? Please explain your answer. (3 Points) (3) Is R in BCNF? Please explain your answer. (3 Points)
Task 1. For each table on the list, identify the functional dependencies. List the functional dependencies....
Task 1. For each table on the list, identify the functional dependencies. List the functional dependencies. Normalize the relations to BCNF. Then decide whether the resulting tables should be implemented in that form. If not, explain why. For each table, write the table name and write out the names, data types, and sizes of all the data items, Identify any constraints, using the conventions of the DBMS you will use for implementation. Write and execute SQL statements to create all...
Consider the following functional dependencies: Z -> XYD, X -> Y. Find the minimal cover of...
Consider the following functional dependencies: Z -> XYD, X -> Y. Find the minimal cover of the above.
1. The functional dependencies for the ProAudio relation: c_id -> f_name, l_name, address, city, state, zip...
1. The functional dependencies for the ProAudio relation: c_id -> f_name, l_name, address, city, state, zip item_id -> title, price ord_no -> c_id, order_date ord_no  + item_id  -> shipped zip -> city, state Original ProAudio relation: c_id f_name I_name address city state zip ord_no item_id title price order_date shipped 01 Jane Doe 123 Elm St Ely NV 11111 1-1 12-31 More Blues 8.99 12-2-00 no 02 Fred Fish 321 Oak St Ely NV 11111 2-1 21-12 Jazz Songs 9.99 11-9-00 yes 01...
1. The functional dependencies for the ProAudio relation: c_id -> f_name, l_name, address, city, state, zip...
1. The functional dependencies for the ProAudio relation: c_id -> f_name, l_name, address, city, state, zip item_id -> title, price ord_no -> c_id, order_date ord_no  + item_id  -> shipped zip -> city, state Original ProAudio relation: c_id f_name I_name address city state zip ord_no item_id title price order_date shipped 01 Jane Doe 123 Elm St Ely NV 11111 1-1 12-31 More Blues 8.99 12-2-00 no 02 Fred Fish 321 Oak St Ely NV 11111 2-1 21-12 Jazz Songs 9.99 11-9-00 yes 01...
1. Consider the following functional dependencies: Z -> XYD, X -> Y Find the minimal cover...
1. Consider the following functional dependencies: Z -> XYD, X -> Y Find the minimal cover of the above. 2. Consider the following two sets of functional dependencies: F = {A -> C, AC -> D, E -> AD, E -> H} and G = {A -> CD, E -> AH}. Check whether they are equivalent.
Consider the relational schemas given below and the respective sets of functional dependencies valid in the...
Consider the relational schemas given below and the respective sets of functional dependencies valid in the schemas. For each one of the relational schemas identify its highest normal form. Remember that the identification of a normal form requires analysis of the valid functional dependencies and the minimal keys. Provide justification of each answer. A solution with no comprehensive justification scores no marks. (iv) When a staff is required to undertake an inspection of properties, the staff is allocated a company...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT