Decomposition and pseudo transitivity rule


Q1. By using the Armstrong’s axioms to prove the soundness of union, decomposition and pseudo transitivity rule with respect to the set of functional dependencies.

Q2. Let consider the given relation for published books:

BOOK (Book_title, Authorname, Book_type, Listprice, Author_affil, Publisher)

Author_affil referes to the affiliation of author. Assume that the given dependencies exist:

Book_title -> Publisher, Book_type
Book_type -> Listprice
Author_name -> Author_affil

a) Illustrate the normal form is the above relation is in? Validate?

b) Normalize the above relation to its maximum normal form.

Q3. Let consider the relation schema EMP_DEPT and the given set G of functional dependencies on EMP_DEPT:

G = {SSN -> {ENAME, BDATE,ADDRESS, DNUMBER} ,

DNUMBER ->{DNAME, DMGRSSN} }. Calculate the closures {SSN} + and {DNUMBER} + with respect to the G.      

Request for Solution File

Ask an Expert for Answer!!
Database Management System: Decomposition and pseudo transitivity rule
Reference No:- TGS011780

Expected delivery within 24 Hours