数据库函数依赖与最高范式判断练习
(1)
PLAYER = ( pnum, team, name, position, address )
pnum → team
pnum → name
pnum → position
pnum → address
team → address
pnum → team, pnum → name, pnum → position and pnum → address, then through union rule
pnum →team, name, position, address, is valid in PLAYER and it covers entire relational schema then its left hand side is a minimal key (pnum)
2NF because no nonprime attribute depends on a part of primary key.
Not 3NF because a nonprime attribute address is transitively dependent on primary key pnum.
pnum → team, team → address.
Highest norm is 2NF
(2)
PART = ( p#, pname, manufacturer, city )
p# → pname,
manufacturer → city
p#, manufacturer → pname, city
p#, manufacturer → pname, manufacturer, city is valid in PART and it covers entire relational schema then its left hand side is a minimal key (p#, man