recategorized by
749 views
1 votes
1 votes
For relation R=(L, M, N, O, P), the following dependencies hold and R is decomposed into R1 = (L, M, N, P) and R2 = (M, O). How to calculate what candidate keys are there for relation R1 and R2. Please tell me the algorithm.

FD's are $M\rightarrow O, NO\rightarrow P, P\rightarrow L, L\rightarrow MN$
recategorized by

1 Answer

1 votes
1 votes

..................

Related questions

2 votes
2 votes
2 answers
1
gatecrack asked Dec 10, 2018
581 views
Is minimal set of functional dependency for a functional dependency set is always unique???
9 votes
9 votes
4 answers
2
saket nandan asked Apr 7, 2016
15,763 views
a relation R(A,B,C,D,E,F,G,H)and set of functional dependencies are {CH->G,A->BC,B->CFH,E->A,F->EG }then how many possible super keys are present ?
1 votes
1 votes
0 answers
3
2 votes
2 votes
2 answers
4
shiva asked Dec 25, 2015
2,592 views
For which of the following set of functions dependencies does the relation $R(A, B, C, D)$ has $AB, CD$ as closed sets?$A \rightarrow B, B \rightarrow A, C \rightarrow D$...