edited by
873 views
0 votes
0 votes

Consider a relation $R(ABCDEFGH)$.

How many superkeys will be there in relation $R$ if the candidate keys for relation are ${A, BC, CDE, EF}$?

edited by

6 Answers

Related questions

4 votes
4 votes
1 answer
1
naveen bhatt asked Dec 7, 2018
1,425 views
Consider the relation R(A,B,C,D,E) with the functional dependencies :A → B, B → C, C → A, D → E, and E → DThe Maximum possible super-keys of R is ______________...
2 votes
2 votes
1 answer
2
srestha asked May 9, 2019
1,832 views
Consider the relation $R\left ( A,B,C,D,E \right )$$A\rightarrow BC$$C\rightarrow E$$B\rightarrow D$$E\rightarrow A$Total number of superkeys present in relation will be ...
4 votes
4 votes
1 answer
3
Akash Kanase asked Jan 15, 2016
731 views
I think here even with Ph is removed from table we still get 12 Super keys. Because Salary & One of CK must be there.
3 votes
3 votes
3 answers
4
Warlock lord asked Aug 29, 2017
1,186 views
Let the relation R(X, Y, Z, A, B) with given functional dependenciesX - YZZ - AA - BAZ - XThe number of super keys possible__________ ?Please answer with an explanation.