Attribute Closure, Step by Step
The closure of an attribute set is everything it determines. Computing it is a short mechanical loop, and it is the single tool used to find keys, tes...
Placement preparation.
59 notes tagged
The closure of an attribute set is everything it determines. Computing it is a short mechanical loop, and it is the single tool used to find keys, tes...
A functional dependency says that whenever two tuples agree on X they must also agree on Y. It is a rule about every possible instance, not an observa...
Division answers questions containing the word every. It is the hardest operator to recognise and the easiest to verify, and it can always be rewritte...
Inner joins discard unmatched tuples. Outer joins keep them and pad with nulls. Semi join keeps only the left tuples that matched, and anti join keeps...
Theta join, equi join and natural join, all defined as a selection over a Cartesian product. The natural join joins on every common attribute and remo...
Union, intersection and difference come straight from set theory, but they require union compatibility. Cartesian product combines every pair and is t...
The three unary operators. Selection picks rows, projection picks columns and removes duplicates, and rename makes an expression reusable. Together th...
Null means the absence of a value, not zero and not empty. Comparisons with null produce unknown, which turns two valued logic into three and changes...
The three integrity rules of the relational model: a primary key may not be null, a foreign key must match an existing primary key or be null, and eve...
Super key, candidate key, primary key, alternate key, composite key, foreign key and surrogate key, defined formally with a worked method for finding...
The relational model has exactly four structural terms. A relation is a set of tuples, a tuple is one fact, an attribute is a named column and a domai...
Seven rules turn any ER diagram into a relational schema: entities become tables, one to many puts a foreign key on the many side, many to many become...