Diagnosis and Repair

Appeal to the integrity constraints of a relational database schema

Decomposition

Assume a relation schema is given by a set of Attributes {A1,...,Ak}, let R be a relational schema and {R1,,Rn} be a set of n relational schemata
Then {R1,,Rn} is a decomposition of R if $$R = \bigcup_{1\leq i\leq n}R_i$$

Integrity constraints can determine that a decomposition does not lose information