I am trying to understand what are the steps to check if a decomposition of table is in 3NF.
There is a specific exercise I'm trying to solve with no success.
- Given that
The decomposition is:
(super keys are shown in bold)
According to the answers this decomposition is not in 3NF.
Unfortunately, I cant understand why. My main difficulty is the transitivity check, and a couple of questions have arisen:
Should I check transitivity per table?
While doing that should I ignore every dependency in a→b in F if a or b does not exist in the table?