Answered You can hire a professional tutor to get the answer.
????,????, ????, ????, ????,????,????,????) and its FD set ???? = {???? ????????, ???? ????????, ???????? ????, ???????? ????????, ???? ????, ????????...
Consider a relation ????(????, ????, ????,????, ????, ????, ????,????,????,????) and its FD set ???? = {???? → ????????, ???? → ????????, ???????? → ????, ???????? → ????????, ???? → ????, ???????? → ????}.
1) Check if ???? → ???? ∈ F + . (1 marks)
2) Find a minimal cover ???????? for ????. (2 marks)
3) Regarding F, is the decomposition R1 = {????????????????????}, R2 = {????????????}, R3 = {????????????????} of ???? lossless-join? Please justify your answer. (2 marks)
4) List at least 5 super-keys for ????. (2 marks)
5) Is it possible to decompose ???? into a collection of BCNF relations and ensure the decomposition is dependency-preserving and lossless-join? Please justify your answers. (3 marks)
