7.21 Give a lossless decomposition into BCNF of schema R of Exercise 7.1. (see 7.1 below)
(7.1) : decompose the schema R = (A, B, C, D, E) into (A, B, C) (A, D, E). Show that this decomposition is a lossless decomposition if the following set F of functional dependencies holds: A → BC CD → E B → D E → A
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here