recategorized
5,372 views
5 5 votes

Identify the minimal key for relational scheme $R(A, B, C, D, E)$ with functional dependencies $F = \left\{A \rightarrow B, B \rightarrow C, AC \rightarrow D\right\}$ 

  1. $A$ 
  2. $AE$
  3. $BE$
  4. $CE$ 

1 Answer

Best answer
4 4 votes

{A}+={ A , B , C , D }

Here A can not be a key because we can't get attribute E from here.

{AE}+ = { A , B , C , D ,E }

Here AE is the minimal key.We can't remove anything from it.

Hence,Option(B)AE.

selected by
Answer:
Position:
Show:

Related questions

6 6 votes
1 1 answer
7.6k
7.6k views
Misbah Ghaya asked Jul 20, 2016
7,558 views
The best normal form of relation scheme $R(A, B, C, D)$ along with the set of functional dependencies $F = \left\{AB \rightarrow C, AB \rightarrow D, C \rightarrow A, D \...
4 4 votes
3 3 answers
6.5k
6.5k views
Misbah Ghaya asked Jul 20, 2016
6,490 views
What kind of mechanism is to be taken into account for converting a weak entity set into strong entity set in entity-relationship diagramGeneralization Aggregation Specia...
4 4 votes
2 answers 2 answers
6.3k
6.3k views
Misbah Ghaya asked Jul 20, 2016
6,252 views
Which of the following is true ?I. Implementation of self-join is possible in SQL with table alias.II. Outer-join operation is basic operation in relational algebra.III. ...
3 3 votes
1 1 answer
3.1k
3.1k views
Misbah Ghaya asked Jul 20, 2016
3,058 views
Division operation is ideally suited to handle queries of the type : Customers who have no account in any of the branches in Delhi. Customers who have an account at all b...