Use Armstrong’s axioms to prove the soundness of the union rule
Answer to relevant QuestionsUse Armstrong’s axioms to prove the soundness of the decomposition rule.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 a loss less-join decomposition into BCNF of schema R of Exercise 7.2.Explain why 4NF is a normal form more desirable than BCNF.Using ODMG C++a. Give schema definitions corresponding to the relational schema shown in Figure, using references to express foreign-key relationships.b. Write programs to compute each of the queries in Exercise 3.10.
Post your question