Given a relation and asked to enumerate all FD's and mark the trivial FD's
-
05-11-2019 - |
Pregunta
Given a relation R(A,B,C) and a FD set (A->B, B->C), find the FD Closure. Enumerate all the FD's and organize them accordingly to the LHS of the FD's. Mark all the trivial FD's.
I am a little confused with the second part of the question and don't understand what exactly they mean by "organize them accordingly to the LHS of the FD's" My understanding is, Apart from the given FD's, we have A->C(on account of transitivity) and the trivial FD's will be A->A , B->B, C->C, A->AB, A->AC, B->BC. Is this the answer to the given question or am I missing something here?
No hay solución correcta
Licenciado bajo: CC-BY-SA con atribución
No afiliado a cs.stackexchange