What is meant by a lossless join decomposition and how is such a decomposition guaranteed
In the process of using functional dependencies to normalize a schema, what is meant by a lossless join decomposition and how is such a decomposition guaranteed? [4 marks] (d) In schema normalization, is Boyce-Codd Normal Form (BCNF) always to be preferred over 3rd Normal Form (3NF)?