Logical Database Design Crossword Puzzle

QUESTIONS LIST:

• closure : the set of attributes that can be functionally determined from a given attribute set
• normalization : the process of organizing data to reduce redundancy and improve integrity
• partial : a functional dependency where a non-key attribute depends on part of a composite key
• transitivity : a rule stating that if a → b and b → c, then a → c
• candidate key : a minimal set of attributes that can uniquely identify a tuple in a relation
• primary key : a unique field or combination of fields that identifies each record in a table
• decomposition : the process of splitting a relation into two or more relations to eliminate anomalies
• lossless : a property of decomposition where no data is lost when original relation is reconstructed
• multi valued : a type of dependency where two or more independent attributes depend on a single attribute
• canonical cover : a minimal and simplified set of functional dependencies that is equivalent to the original
• 1nf : the first normal form which ensures that each column contains atomic values only
• 2nf : the second normal form which removes partial dependencies from a 1nf relation
• 3nf : the third normal form which removes transitive dependencies from a 2nf relation
• bcnf : a stronger version of 3nf where every determinant is a super key
• 5nf : a normal form that removes join dependencies to ensure lossless decomposition