Explain what is meant by repetition of information and inability to represent information. Explain why each of these properties may indicate a bad relationaldatabase design.
Answer to relevant QuestionsSuppose that we decompose the schema R = (A, B, C, D, E) into (A, B, C) (A, D, E). Show that this decomposition is a loss less-join decomposition if the following set F of functional dependencies holds: A → BC CD ...Consider the following proposed rule for functional dependencies: If α → β and γ → β, then α → γ. Prove that this rule is not sound by showing a relation r that satisfies ...Consider the algorithm in figure to compute α+. Show that this algorithm is more efficient than the one presented in Figure (Section 7.3.3) and that it computes α+ correctly.Give an example of a relation schema R` and set F` of functional dependencies such that there are at least three distinct lossless-join decompositions of R` into BCNF.For each of the following application areas, explain why a relational database system would be inadequate. List all specific system components that would need to be modified.a. Computer-aided designb. Multimedia databases
Post your question