The Relational Model and Normalization Questions

• The functional dependency R → S means that the value of S can be determined when we are given a value of R.
• A candidate key is a determinant that determines all the other columns is a relation.
• In a relation, the rows are sometimes called "fields."
• A relation is in 5NF when multivalued dependencies are isolated in their own relation.
• Keys made up of two or more attributes are called composite keys.
• A functional dependency is a relationship between or among attributes.
• A primary key is a composite key that was selected to be the main identifier for the relation.
• A relation is a two-dimensional table.
• The only reason for the existence of relations is to store instances of functional dependencies.
• Given the functional dependency R → (S,T) , then it is also true that R → S.
• A relation is in Boyce-Codd Normal Form (BCNF) if every determinant is a composite key.
• Any table that meets the definition of a relation is said to be in first normal form.
• In a relation, the order of the rows matters.
• Given the functional dependency R → S , R is called the determinant.
• In a relation, the rows are sometimes called "records."
• In a relation, the order of the columns does not matter.
• A relation has cells that hold multi-value entries.
• Relations are categorized into normal forms according to the referential integrity constraints that they have.
• A functional dependency is always an equation.
• A key is a group of one or more attributes that uniquely identifies a row.