Decomposing a Schema into BCNF Suppose we have a schema R and a non-trivial dependency a>B causes a violation of BCNF. We decompose R into: 。(aUB) ·(R-(B-a) In our example, a=dept_name B=building,budget and inst_dept is replaced by (aUB)=(dept name,building,budget (R-（B-))=（lD,name,salary,dept_name) Database System Concepts-6th Edition 8.18 @Silberschatz,Korth and SudarshanDatabase System Concepts - 6 8.18 ©Silberschatz, Korth and Sudarshan th Edition Decomposing a Schema into BCNF Suppose we have a schema R and a non-trivial dependency  → causes a violation of BCNF. We decompose R into: • ( U  ) • ( R - (  -  ) ) In our example,  = dept_name  = building, budget and inst_dept is replaced by ( U  ) = ( dept_name, building, budget ) ( R - (  -  ) ) = ( ID, name, salary, dept_name )