Question

Please answer ASAP

Database

Consider the following relation scheme:
Players = {name, position, year, team, manager}
We use the following abbreviations:
Players = {n, p, y, t, m}
with the following FDs
n --> p
n, y --> t
t, y --> m
(3.a) Is Players in BCNF? Explain why.
(3.b) Find all candidate keys of Players. Show your work.
(3.c) Obtain a decomposition of players using the 3NF decomposition algorithm. Assume the
given FDs are a minimal (canonical) cover. Show your work.
(3.d) Assume the following FD also holds in players (in addition to the FDs listed above).
t, m ! y
Find all candidate keys of Players for this case. Show your work.

Answer 1

Candidate key is a minimal set of attributes that uniquely identifies a tuple in a relation.

BCNF - Boyce codd normal form

I order to find out whether players is in BCNF or not we will check for all normal forms.

Steps to find candidate key for players