If the decomposition is able to represent all the facts about the relation then such a decomposition is called as?
(a) Lossless decomposition
(b) Lossy decomposition
(c) Insecure decomposition
(d) Secure decomposition
The question was posed to me during an online interview.
My question is taken from Features of Good Relational Design in portion Relational Database Design of RDBMS