Self - Doubt : How to calculate candidate keys in decomposed Relation?

Question

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$

Comments

It is NP-C problem.There is no liner time algo. check some existing examples on GO.you will understand

---

question is incomplete.

fd is not given

---

Hi sir..I am not able to understand bruteforce algorithm also.

Please suggest what is the bruteforce algo?

do i need to perform $F^{+}\cap R_{1} $  and  $F^{+}\cap R_{2} $the find all the candidate keys to corresponding table?

Answer 1

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

Comments

Its what I thought too... I am not sure about this.

---

yes i am also canfuse here.
but in made easy note book its  mention "only those fd are include in decomposed relation . which is present in orignal relation R"

---

Please refer to this question to clear your doubt: https://gateoverflow.in/48168/isi2011-cs-5b