Database Management Systems · topic
1NF, 2NF, 3NF and BCNF with their exact conditions and the anomalies they remove, a routine for the highest normal form, lossless-join tests (common attributes and the chase), dependency preservation, 3NF synthesis and BCNF decomposition; 4NF as a marked note.
The update, insertion and deletion anomalies that normalization removes; the exact conditions of 1NF, 2NF, 3NF and BCNF stated per FD; prime and non-prime attributes; a routine for the highest normal form that tests BCNF first; nine verdicts computed by script, including a checked past GATE question; the shortcuts that are safe (two attributes, single-attribute keys, all attributes prime) and the ones that are not; and 4NF as a marked note beyond the syllabus.
A partial preview of the top of the sheet. The full sheet is in the Database Management Systems cheat sheet pack.
The binary lossless-join test on the common attributes and the chase for three or more parts, with spurious tuples shown on an instance; the dependency-preservation test that grows a closure across the parts; the 3NF synthesis algorithm and BCNF decomposition, each run on an example by script; why 3NF can always keep every FD while BCNF sometimes cannot; and two checked past GATE questions.
A partial preview of the top of the sheet. The full sheet is in the Database Management Systems cheat sheet pack.
