New answers tagged

2

Does the relation create information redundancy? Yes, for instance you have the information on the file (name, size, data creation, etc.) repeated for different accesses to the same file. What would a decomposition of R without loss of information and without loss of dependency be? The following decomposition is both in Third Normal Form and in ...


2

The only candidate key of your relation is {D DA HA L NF} (perhaps with R you mean D?) You can verify this by calculating the closure of those attributes, {D DA HA L NF}+, and seeing that it contains all the attributes, while, if you remove any one of them, the closure of the remaining set does not contains all the attributes (this is the definition of a ...



Top 50 recent answers are included