Hi guys I have the following assignment to solve :
1. Let schema R = (A;B;C;D;E), with the following set of functional dependencies F:
A →BC
EB → C
CD → E
B → D
E → A
(a) List all candidate keys for R (4 points).

I don't want the solution just an explanation where should I start . what is the algorithm for find the candidate keys ? should I use Armstrongs' axioms and list the atributtes that appear on L.H.S. and R.H.S. or ????

Thanks

Moving to DB Concepts

pootle flump ur codings are working excelent.