if a minimal cover has 10 functional dependencies, any set of 12 functional dependencies cannot be...

Question

Question

if a minimal cover has 10 functional dependencies, any set of 12 functional dependencies cannot be a minimal cover.

Is this true or false? Why?

Answer 1

Answer #1

if a minimal cover has 10 functional dependencies, any set of 12 functional dependencies cannot be a minimal cover.

False

Reason:

If a minimal cover has 10 functional dependencies, any set of 12 functional dependencies may be a minimal cover.
Minimal cover has 10 functional dependencies but the actual FDs are more than Minimal cover of 10 FDs is possible.
So all possible FD's are not minimal FD, So do remove of redundendy(Remove extraneous attributes) to get minimal functional dependencies.
So after remove extraneous attributes it may be a minimal cover.

Answer 2

Similar Homework Help Questions

The right side of any functional dependency must contain a candidate key. TRUE FALSE » Given a set of functional dependencies F, there always exists a canonical cover of F TRUE FALSE Some schemas can...

The right side of any functional dependency must contain a candidate key. TRUE FALSE » Given a set of functional dependencies F, there always exists a canonical cover of F TRUE FALSE Some schemas cannot be transformed into BCNF FALSE TRUE Every schema can be transformed into 3NF, and the resulting schema is dependency- preserving TRUE FALSE . Any schema that is in BCNF is also in 3NF FALSE TRUE The right side of any functional dependency must contain a...
Here's a relation (R), its attributes and its functional dependencies (F): R(A, B, C, D, E)...

Here's a relation (R), its attributes and its functional dependencies (F): R(A, B, C, D, E) C D → B A → D D → C E → C What is the closure of AB ({AB}+)? What is the closure of F (F+)? [ set of closures for all LHS][each LHS on one line] What is the minimal set (cover) for F? Provide a key for relation R (a minimal set of attributes that can determine all attr.) Decompose the...
given a set of functional dependencies

given a set of functional dependenciesF = {AB → C, C → B}, above the relational scheme R (A, B, C).Prove that {AB → AC, AB → BC, AC → B, AC → AB} F +

Consider the following relation R(A,B,C,D,E,G) and the set of functional dependencies F = { A →...

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} Give a 3NF decomposition of the given schema based on a canonical cover
Language: SQL - Normalization and Functional Dependencies Part 4 Normalization and Functional Dependencies Consider the following relation R(A, B, C, D)and functional dependencies F that hold o...

Language: SQL - Normalization and Functional Dependencies Part 4 Normalization and Functional Dependencies Consider the following relation R(A, B, C, D)and functional dependencies F that hold over this relation. F=D → C, A B,A-C Question 4.1 (3 Points) Determine all candidate keys of R Question 4.2 (4 Points) Compute the attribute cover of X-(C, B) according to F Question 43 (5 Points) Compute the canonical cover of F.Show each step of the generation according to the algorithm shown in class....
Given a schema R (A, B, C, D, E, F)and a set Fof functional dependencies {A...

Given a schema R (A, B, C, D, E, F)and a set Fof functional dependencies {A →B, A →D, CD →E, CD →F, C →F, C →E, BD →E}, find the closure of the set of functional dependencies ?+

Mark True/False for functional dependencies of the following table R(A, B, C, D, E), where we...

Mark True/False for functional dependencies of the following table R(A, B, C, D, E), where we assume that it is the intent of the designer that exactly this set of rows should list in the table. A B C D E a1 b1 c1 d1 e1 a2 b2 c2 d2 e2 a1 b1 c1 d1 e2 a2 b2 c3 d4 e2 (a) A --> B (b) B --> A (c) C--> A (d) D --> A (e) CD --> B
Consider the following relation: R(A,B,C,D,E) The following set of functional dependencies are ture on the relation...

Consider the following relation: R(A,B,C,D,E) The following set of functional dependencies are ture on the relation R: FD: AB -> E, E -> D, AD -> C Which of the following sets of attributes does not functionally determine C? AC ABE BD AE AB
Consider the following schema and functional dependencies: SHIPPING (ShipName, ShipType, VoyageID, Cargo, Port, ArrivalDate) Key: ShipName,...

Consider the following schema and functional dependencies: SHIPPING (ShipName, ShipType, VoyageID, Cargo, Port, ArrivalDate) Key: ShipName, ArrivalDate FD1: ShipName > ShipType FD2: VoyageID > ShipName, Cargo FD3: ShipName, ArrivalDate > VoyageId, Port 1.Please list the final set of 3NF schema including all its keys. 2.Do any of the finalized 3NF schema have determinates that are not candidate keys? If yes, explain - which schema(s)? Why?

Examine the determinants of the functional dependencies. If any determinant is not a candidate key, the...

Examine the determinants of the functional dependencies. If any determinant is not a candidate key, the relation is not well formed. In this case: a. Place the columns of the functional dependency in a new relation of their own. b. Make the determinant of the functional dependency the primary key of the new relation. c. Leave a copy of the determinant as a foreign key in the original relation. d. Create a referential integrity constraint between the original relation and...