For alphabetization purposes, (a) differences in fonts and case are ignored; (b) quotation marks are ignored; (c) other punctuation symbols—hyphens, underscores, parentheses, etc.—are treated as blanks; (d) numerals precede letters; (e) blanks precede everything else.
A note on the digital index
A link in an index entry is displayed as the section title in which that entry appears. Because some sections have multiple index markers, it is not unusual for an entry to have several links to the same section. Clicking on any link will take you directly to the place in the text in which the marker appears.
Symbols
- (3,3)NF, “Restriction-union” normal form
- (JD star), JDs and 5NF (Informal)
- 0-tuple, CHAPTER 2, CHAPTER 4
- 2NF, see second normal form, ... AND STILL ANOTHER
- 3NF procedure, A PROCEDURE THAT WORKS
- 3NF, see third normal form, ... AND STILL ANOTHER
- 5NF, see fifth normal form, PREDICATES AND PROPOSITIONS
- 6NF, see sixth normal form, PREDICATES AND PROPOSITIONS
- “arrow out of X”, FUNCTIONAL DEPENDENCIES
- “atomic fact,” 142, SIXTH NORMAL FORM
- “getting rid of” (constraints), BOYCE/CODD NORMAL FORM
- “materialized view,” 175, We Need More Science
- “restriction-union” normal form, Elementary key normal form (EKNF)
- “well architected,” 241, CHAPTER 8
- → (FD arrow), MORE ON SUPPLIERS AND PARTS
A
- Abbey, Edward, PREDICATES AND PROPOSITIONS
- Abbot, Bud, MVDs and 4NF
- Abiteboul, Serge, THE CHASE ALGORITHM
- Adamson, Chris, Logical vs. Physical Design, WHAT DENORMALIZATION ISN’T (I)
- Adiba, Michel, 2. Declare the Constraint
- Aho, A.V., Historical Notes
- ALL BUT, Normalization: Some Generalities
- all key, KEYS REVISITED
- alternate key, KEYS, Primary Keys Are Nice but Not Essential
- AND (aggregate operator), MORE ON SUPPLIERS AND PARTS, A SIMPLER EXAMPLE
- Armstrong, Louis, Preliminaries
- Armstrong, W.W., FD Axiomatization, Historical Notes
- Armstrong’s axioms, ARMSTRONG’S AXIOMS
- attribute, RELATIONS AND RELVARS, PRELIMINARY DEFINITIONS, ARMSTRONG’S AXIOMS
- attribute-name / type-name pair, RELATIONS AND RELVARS
- tuple valued, see tuple valued attribute, ARMSTRONG’S AXIOMS
- axiomatization, ARMSTRONG’S AXIOMS, ARMSTRONG’S AXIOMS, THE CHASE ALGORITHM, FOURTH NORMAL FORM
- FDs, ARMSTRONG’S AXIOMS
- MVDs, FOURTH NORMAL FORM
- not for JDs, THE CHASE ALGORITHM
B
- Bacon, Francis, FD Axiomatization
- base relvar, OVERVIEW
- BCNF procedure, A PROCEDURE THAT WORKS
- BCNF, see Boyce/Codd normal form, A PROCEDURE THAT WORKS
- Beeri, Catriel, Historical Notes
- Bennett, Alan, Primary Keys Are Nice but Not Essential
- body, RELATIONS AND RELVARS, RELATIONS AND RELVARS, PRELIMINARY DEFINITIONS, PRELIMINARY DEFINITIONS, PRELIMINARY DEFINITIONS
- relation, RELATIONS AND RELVARS, PRELIMINARY DEFINITIONS
- relvar, PRELIMINARY DEFINITIONS
- bound variable, REFINING THE DEFINITION
- Boyce, Raymond F., BOYCE/CODD NORMAL FORM, BOYCE/CODD NORMAL FORM
- Boyce/Codd normal form, BOYCE/CODD NORMAL FORM, BOYCE/CODD NORMAL FORM, FUNCTIONAL DEPENDENCIES
- explanation of name, BOYCE/CODD NORMAL FORM
- Brown, Robert R., THE PLACE OF DESIGN THEORY
- business rule, AN UNFORTUNATE CONFLICT
C
- candidate key, KEYS, KEYS REVISITED
- canonical form, CONCLUDING REMARKS
- cardinality, RELATIONS AND RELVARS
- Carroll, Lewis, We Need More Science
- Casanova, Marco A., Historical Notes
- chase algorithm, SUMMARY SO FAR
- Churchill, Winston, Additional Normal Forms
- Closed World Assumption, The, PREDICATES AND PROPOSITIONS, DATABASE DESIGN IS PREDICATE DESIGN, EXAMPLE 7, CHAPTER 2
- closure, EXERCISES, EXERCISES, ARMSTRONG’S AXIOMS, ANOTHER KIND OF CLOSURE, CHAPTER 2, CHAPTER 2, CHAPTER 4
- relational algebra, EXERCISES, CHAPTER 2
- set of attributes, ANOTHER KIND OF CLOSURE
- set of FDs, ARMSTRONG’S AXIOMS, CHAPTER 4
- Codd, E. F., passim, THE RUNNING EXAMPLE
- commalist, THE RUNNING EXAMPLE
- common sense, THE PLACE OF DESIGN THEORY
- completeness, ARMSTRONG’S AXIOMS
- component (JD), JDs and 5NF (Informal), JDs and 5NF (Formal)
- composite key, KEYS
- connection trap, A RELVAR IN BCNF AND NOT 5NF
- connective, SIXTH NORMAL FORM
- CONSTRAINT, MORE ON SUPPLIERS AND PARTS, MORE ON SUPPLIERS AND PARTS, NORMALIZATION SERVES TWO PURPOSES, CHAPTER 4
- contain vs. include, CHAPTER 1
- contradiction, IDENTITY DECOMPOSITIONS
- Costello, Lou, MVDs and 4NF
- cover (FDs), A PROCEDURE THAT WORKS
- CWA, see Closed World Assumption, The, A RELVAR IN BCNF AND NOT 5NF
- cyclic rules, A RELVAR IN BCNF AND NOT 5NF
D
- D, MORE ON SUPPLIERS AND PARTS
- da Vinci, Leonardo, THE PLACE OF DESIGN THEORY
- Darling, David, The Principle of Orthogonal Design
- Darwen, Hugh, passim, SOME QUOTES FROM THE LITERATURE
- data model, A NOTE ON TERMINOLOGY, A NOTE ON TERMINOLOGY, A NOTE ON TERMINOLOGY
- first sense, A NOTE ON TERMINOLOGY
- second sense, A NOTE ON TERMINOLOGY
- database professional, Prerequisites
- Date, C. J., passim, Answers to Exercises
- Dawkins, Richard, Answers to Exercises
- DBMS, Logical vs. Physical Design
- decomposition, see nonloss decomposition, RELATIONS AND RELVARS
- DEE, see TABLE_DEE, RELATIONS AND RELVARS
- degree, RELATIONS AND RELVARS
- deletion anomaly, UPDATE ANOMALIES, UPDATE ANOMALIES REVISITED, DOMAIN-KEY NORMAL FORM, CHAPTER 2
- and 5NF, UPDATE ANOMALIES REVISITED
- and BCNF, UPDATE ANOMALIES
- denormalization, Denormalization, WHAT DOES DENORMALIZATION MEAN?, DENORMALIZATION CONSIDERED HARMFUL (I)
- considered harmful, DENORMALIZATION CONSIDERED HARMFUL (I)
- increasing redundancy, WHAT DOES DENORMALIZATION MEAN?
- dependant, FUNCTIONAL DEPENDENCIES, FUNCTIONAL DEPENDENCIES, PRELIMINARY DEFINITIONS, FUNCTIONAL DEPENDENCIES, MULTIVALUED DEPENDENCIES (INFORMAL)
- dependency, THE NORMAL FORM HIERARCHY, Preserving FDs, FOURTH NORMAL FORM
- implicit, see implicit dependencies, Preserving FDs, FOURTH NORMAL FORM
- dependency preservation, Preserving FDs, FOURTH NORMAL FORM
- determinant, FUNCTIONAL DEPENDENCIES, FUNCTIONAL DEPENDENCIES, PRELIMINARY DEFINITIONS, FUNCTIONAL DEPENDENCIES, MULTIVALUED DEPENDENCIES (INFORMAL)
- Dickinson, Emily, JDs and 5NF (Formal)
- Dijkstra, Edsger W., Database Design and Relational Theory
- dimension table, WHAT DENORMALIZATION ISN’T (II)
- DK/NF, see domain-key normal form, REDUNDANCY FREE NORMAL FORM, CHAPTER 1
- domain, REDUNDANCY FREE NORMAL FORM, CHAPTER 1
- domain constraint (DK/NF), REDUNDANCY FREE NORMAL FORM
- domain-key normal form, REDUNDANCY FREE NORMAL FORM
- double underlining, KEYS, CHAPTER 4
- DUM, see TABLE_DUM, TUPLES vs. PROPOSITIONS
- duplicate tuples, TUPLES vs. PROPOSITIONS, EXAMPLE 6
- see also tuple equality, EXAMPLE 6
E
- E-relvar, EXAMPLE 6
- E/R modeling, Preface, DATABASE DESIGN IS PREDICATE DESIGN
- EKNF, see elementary key normal form, Elementary key normal form (EKNF)
- elementary key, Elementary key normal form (EKNF)
- elementary key normal form, Elementary key normal form (EKNF)
- Elmasri, Ramez, EXERCISES
- embedded dependencies, AXIOMATIZATION
- empty key, EXERCISES, CHAPTER 2
- empty restriction, IDENTITY DECOMPOSITIONS
- empty tuple, EXERCISES, CHAPTER 2
- entity integrity, ARGUMENTS IN DEFENSE OF THE PK:AK DISTINCTION
- entity supertype/subtype, EXAMPLE 1, THE APPLICANTS AND EMPLOYEES EXAMPLE
- entity/relationship modeling, see E/R modeling, EXAMPLE 1, THE APPLICANTS AND EMPLOYEES EXAMPLE
- EQD, see equality dependency, CHAPTER 2
- equality, NORMALIZATION SERVES TWO PURPOSES, NORMALIZATION SERVES TWO PURPOSES, EQUALITY DEPENDENCIES, EQUALITY DEPENDENCIES, CHAPTER 2
- relation, see relation equality, NORMALIZATION SERVES TWO PURPOSES, EQUALITY DEPENDENCIES
- tuple, see tuple equality, NORMALIZATION SERVES TWO PURPOSES, EQUALITY DEPENDENCIES
- equality dependency, NORMALIZATION SERVES TWO PURPOSES, EQUALITY DEPENDENCIES
- equality generating dependency, THE CHASE ALGORITHM
- equivalence, EXERCISES, COMBINING COMPONENTS, IRREDUCIBLE JDs
- JDs, COMBINING COMPONENTS
- sets of FDs, EXERCISES
- essential, Historical Notes
- essential tuple normal form, REDUNDANCY FREE NORMAL FORM, Redundancy Revisited, Historical Notes
- ETNF, see essential tuple normal form, REFINING THE DEFINITION
- existential quantifier, REFINING THE DEFINITION
- EXISTS, JOIN DEPENDENCIES—THE BASIC IDEA, DATABASE DESIGN IS PREDICATE DESIGN
- explicit dependencies, SUMMARY SO FAR
- EXTEND, EXAMPLE 11
F
- fact table, WHAT DENORMALIZATION ISN’T (II)
- factorial, CHAPTER 4
- Fagin, Ronald, passim, MULTIVALUED DEPENDENCIES (INFORMAL), Historical Notes
- Fagin’s Theorem, MULTIVALUED DEPENDENCIES (FORMAL), Historical Notes
- Fallacy of False Conversion, The, WHAT DOES DENORMALIZATION MEAN?
- FD, MORE ON SUPPLIERS AND PARTS, FIRST NORMAL FORM, FUNCTIONAL DEPENDENCIES, PRELIMINARY DEFINITIONS, FUNCTIONAL DEPENDENCIES, BOYCE/CODD NORMAL FORM, ARMSTRONG’S AXIOMS, A USEFUL THEOREM
- axiomatization, ARMSTRONG’S AXIOMS
- not a JD, A USEFUL THEOREM
- of a relvar, FUNCTIONAL DEPENDENCIES
- trivial, FUNCTIONAL DEPENDENCIES, BOYCE/CODD NORMAL FORM
- FD graph, MORE ON THE CONFLICT
- FD redundant, REDUNDANCY FREE NORMAL FORM, Historical Notes
- fifth normal form, CYCLIC RULES, FIFTH NORMAL FORM
- not necessarily redundancy free, CYCLIC RULES
- first normal form, FIRST NORMAL FORM, FIRST NORMAL FORM, FIRST NORMAL FORM, FIRST NORMAL FORM
- relation, FIRST NORMAL FORM
- relvar, FIRST NORMAL FORM
- table, FIRST NORMAL FORM
- FORALL, DATABASE DESIGN IS PREDICATE DESIGN
- foreign key, KEYS
- fourth normal form, BOYCE/CODD NORMAL FORM, FOURTH NORMAL FORM
- Boyce, BOYCE/CODD NORMAL FORM
- Frege, Gottlob, DATABASE DESIGN IS PREDICATE DESIGN
- fully redundant, Historical Notes
- functional dependency, see FD, Normalization: Some Generalities, Normalization: Some Generalities
- see also Boyce/Codd normal form, Normalization: Some Generalities
- further normalization, Normalization: Some Generalities
G
H
- Hall, Patrick, EXAMPLE 9
- Hamdan, Sam, “DENORMALIZE FOR PERFORMANCE”?
- heading, RELATIONS AND RELVARS, PRELIMINARY DEFINITIONS, PRELIMINARY DEFINITIONS
- relation, RELATIONS AND RELVARS, PRELIMINARY DEFINITIONS
- Heath notation, FD Axiomatization
- Heath, Ian, HEATH’S THEOREM, Historical Notes
- Heath’s Theorem, BOYCE/CODD NORMAL FORM, JOIN DEPENDENCIES—THE BASIC IDEA, EXERCISES, Historical Notes, CHAPTER 5
- extended version, EXERCISES
- Hesiod, Database Design and Relational Theory
- hold (in a relvar), FUNCTIONAL DEPENDENCIES, FUNCTIONAL DEPENDENCIES, JOIN DEPENDENCIES
- horizontal decomposition, A SIMPLER EXAMPLE
- Howard, John H., Historical Notes
- Hull, Richard, THE CHASE ALGORITHM
I
- IDENTICAL, EXAMPLE 6
- identity decomposition, IDENTITY DECOMPOSITIONS
- identity projection, IDENTITY DECOMPOSITIONS
- identity restriction, IDENTITY DECOMPOSITIONS
- image relation, EXAMPLE 12
- implicit dependencies, Implicit Dependencies, SUMMARY SO FAR
- implied by keys, BOYCE/CODD NORMAL FORM, BOYCE/CODD NORMAL FORM, JOIN DEPENDENCIES, MULTIVALUED DEPENDENCIES (FORMAL)
- implied by superkeys, see implied by keys, FIRST NORMAL FORM
- IMS, FIRST NORMAL FORM
- include vs. contain, CHAPTER 1
- inclusion dependency, EQUALITY DEPENDENCIES
- IND, see inclusion dependency, INDEPENDENT PROJECTIONS
- independent projections, INDEPENDENT PROJECTIONS
- information equivalence, Normalization: Some Generalities
- Information Principle, The, CHAPTER 1, CHAPTER 8
- insertion anomaly, UPDATE ANOMALIES, UPDATE ANOMALIES REVISITED, DOMAIN-KEY NORMAL FORM, CHAPTER 2
- and 5NF, UPDATE ANOMALIES REVISITED
- and BCNF, UPDATE ANOMALIES
- instance, see relation schema, RELATIONS AND RELVARS
- instantiation, RELATIONS AND RELVARS
- integrity constraint, see constraint, A PROCEDURE THAT WORKS, ADDITIONAL RULES
- irreducibility, KEYS REVISITED, KEYS REVISITED, FUNCTIONAL DEPENDENCIES, A PROCEDURE THAT WORKS, A PROCEDURE THAT WORKS, ADDITIONAL RULES, ADDITIONAL RULES, COMBINING COMPONENTS, SIXTH NORMAL FORM, SIXTH NORMAL FORM
- cover, A PROCEDURE THAT WORKS, ADDITIONAL RULES
- FD, KEYS REVISITED, FUNCTIONAL DEPENDENCIES
- JD, COMBINING COMPONENTS
- key, KEYS REVISITED
- relvar, SIXTH NORMAL FORM
- “fact,” 142, SIXTH NORMAL FORM
- irrelevant component (JD), IRRELEVANT COMPONENTS
- IS_EMPTY, A CLARIFICATION, CHAPTER 6
J
- JD, JDs and 5NF (Informal), JDs and 5NF (Formal), JOIN DEPENDENCIES, FIFTH NORMAL FORM, FIFTH NORMAL FORM, FIFTH NORMAL FORM, REDUNDANCY FREE NORMAL FORM, Historical Notes
- implied by superkeys, FIFTH NORMAL FORM, FIFTH NORMAL FORM
- of a relvar, JOIN DEPENDENCIES
- see also fifth normal form; sixth normal form, REDUNDANCY FREE NORMAL FORM, Historical Notes
- trivial, FIFTH NORMAL FORM
- JD redundant, REDUNDANCY FREE NORMAL FORM, Historical Notes
- join, PRELIMINARY DEFINITIONS, EXERCISES, EXERCISES, JDs IMPLIED BY KEYS, CHAPTER 4
- of no relations, EXERCISES
- of one relation, EXERCISES, JDs IMPLIED BY KEYS, CHAPTER 4
- join dependency, see JD, PRELIMINARY DEFINITIONS
- joinable, PRELIMINARY DEFINITIONS
K
- KCNF, see key complete normal form, THE RUNNING EXAMPLE, FUNCTIONAL DEPENDENCIES, BOYCE/CODD NORMAL FORM
- key, THE RUNNING EXAMPLE, FUNCTIONAL DEPENDENCIES, BOYCE/CODD NORMAL FORM
- key attribute, KEYS REVISITED
- key complete normal form, Redundancy Revisited
- key constraint, MORE ON SUPPLIERS AND PARTS, BOYCE/CODD NORMAL FORM, DOMAIN-KEY NORMAL FORM
- Kimball, Ralph, WHAT DENORMALIZATION ISN’T (II)
- Korth, Henry F., EXERCISES
L
- Lindsay, Bruce G., 2. Declare the Constraint
- logical vs. physical design, Preface, KEYS, We Need More Science, CHAPTER 8
- Lorentzos, Nikos A., Preface, EXAMPLE 11, Historical Notes
- lossless decomposition, BOYCE/CODD NORMAL FORM, BOYCE/CODD NORMAL FORM
- see nonloss decomposition, BOYCE/CODD NORMAL FORM
- lossy decomposition, BOYCE/CODD NORMAL FORM
- lossy join, NORMALIZATION SERVES TWO PURPOSES, HEATH’S THEOREM
M
- McGoveran, David, Logical vs. Physical Design, Historical Notes
- Melzak, Z.A., FDs and BCNF (Informal)
- membership algorithm, FIFTH NORMAL FORM
- missing information, SIXTH NORMAL FORM, A CLARIFICATION
- modification anomaly, UPDATE ANOMALIES, CHAPTER 3
- multiple assignment, A LITTLE HISTORY
- multirelvar constraint, NORMALIZATION AND CONSTRAINTS, BOYCE/CODD NORMAL FORM, INDEPENDENT PROJECTIONS, FIFTH NORMAL FORM, AN INTRODUCTORY EXAMPLE, FOURTH NORMAL FORM
- multivalued attribute, FIRST NORMAL FORM
- multivalued dependency, see MVD, MVDs and 4NF, AN INTRODUCTORY EXAMPLE
- MVD, MVDs and 4NF, AN INTRODUCTORY EXAMPLE, FOURTH NORMAL FORM, FOURTH NORMAL FORM, EXERCISES, CHAPTER 10, CHAPTER 12
- implied by superkey, FOURTH NORMAL FORM
- see also fourth normal form, CHAPTER 10
- shorthand notation, EXERCISES, CHAPTER 12
- trivial, FOURTH NORMAL FORM
- →→ (MVD double arrow), AN INTRODUCTORY EXAMPLE
N
- n pick r, CHAPTER 10
- natural join, see join, EXERCISES
- Navathe, Shamkant B., EXERCISES
- Nixon, Richard M., CONCLUDING REMARKS
- nonkey attribute, KEYS REVISITED
- nonloss decomposition, Normalization: Some Generalities
- nonprime attribute, KEYS REVISITED
- normal form, THE NORMAL FORM HIERARCHY, CONCLUDING REMARKS, Additional Normal Forms
- hierarchy, THE NORMAL FORM HIERARCHY, Additional Normal Forms
- normalization, Normalization: Some Generalities, Normalization: Some Generalities, THE NORMAL FORM HIERARCHY, CONCLUDING REMARKS, AN UNFORTUNATE CONFLICT, WHAT DOES DENORMALIZATION MEAN?, The Principle of Orthogonal Design, TWO CHEERS FOR NORMALIZATION, CHAPTER 3
- and constraints, THE NORMAL FORM HIERARCHY
- conventional procedure, AN UNFORTUNATE CONFLICT
- decreasing redundancy, WHAT DOES DENORMALIZATION MEAN?
- goals, TWO CHEERS FOR NORMALIZATION
- principles, The Principle of Orthogonal Design
- two purposes, Normalization: Some Generalities, CHAPTER 3
- normalized, FIRST NORMAL FORM
- null, FIRST NORMAL FORM, CHAPTER 2
O
- Open World Assumption, The, CHAPTER 2
- orthogonal decomposition, TWO CHEERS FOR NORMALIZATION
- orthogonality, TWO CHEERS FOR NORMALIZATION
- overstrong PJ/NF, Overstrong PJ/NF
- OWA, see Open World Assumption, The, EXAMPLE 9
- Owlett, John, EXAMPLE 9
P
- P-relvar, EXAMPLE 6
- Papadimitriou, Christos H., Historical Notes
- partly redundant, Historical Notes
- Pascal, Fabian, EXAMPLE 11
- physical design, see logical design, “Restriction-union” normal form
- PJ/NF, see fifth normal form, “Restriction-union” normal form
- PJSU/NF, “Restriction-union” normal form
- PK:AK distinction, Primary Keys Are Nice but Not Essential
- plausible tuple, EXAMPLE 7, EXAMPLE 7
- see Closed World Assumption, The, EXAMPLE 7
- Polya, George, EXAMPLE 7
- predicate, PREDICATES AND PROPOSITIONS, EXERCISES, EQUALITY DEPENDENCIES, EQUALITY DEPENDENCIES, SIXTH NORMAL FORM, SIXTH NORMAL FORM, A SIMPLER EXAMPLE, CHAPTER 2
- composite / compound, EQUALITY DEPENDENCIES
- conjunctive, SIXTH NORMAL FORM
- empty set of parameters, EXERCISES, CHAPTER 2
- overlapping, A SIMPLER EXAMPLE
- relvar, see relvar predicate, EQUALITY DEPENDENCIES
- simple, SIXTH NORMAL FORM
- preserving dependencies, see dependency preservation, KEYS, Primary Keys Are Nice but Not Essential
- primary key, KEYS, Primary Keys Are Nice but Not Essential
- prime attribute, KEYS REVISITED
- Principle of Cautious Design, The, ARGUMENTS IN DEFENSE OF THE PK:AK DISTINCTION
- Principle of Interchangeability, The, OVERVIEW, Primary Keys Are Nice but Not Essential, RELVARS WITH MORE THAN ONE KEY
- Principle of Orthogonal Design, The, TWO CHEERS FOR NORMALIZATION, THE FIRST EXAMPLE REVISITED
- “final” definition, THE FIRST EXAMPLE REVISITED
- principles of normalization, see normalization, MORE ON SUPPLIERS AND PARTS, Normalization: Some Generalities, PRELIMINARY DEFINITIONS
- projection, MORE ON SUPPLIERS AND PARTS, Normalization: Some Generalities, PRELIMINARY DEFINITIONS
- projection-join normal form, CYCLIC RULES, FIFTH NORMAL FORM
- proper subset, see subset, PREDICATES AND PROPOSITIONS
- proper superset, see superset, PREDICATES AND PROPOSITIONS
- proposition, PREDICATES AND PROPOSITIONS
Q
- quantifier, EXERCISES, DATABASE DESIGN IS PREDICATE DESIGN
- see also EXISTS; FORALL, EXERCISES
R
- Ramakrishnan, Raghu, EXERCISES
- redundancy, TUPLES vs. PROPOSITIONS, We Need More Science, EXAMPLE 12, 4. Use a Snapshot, REFINING THE DEFINITION, Redundancy Revisited, Redundancy Revisited
- controlled, 4. Use a Snapshot
- managing, EXAMPLE 12
- revisited, Redundancy Revisited
- Vincent’s definition, Redundancy Revisited
- “final” definition, REFINING THE DEFINITION
- redundancy free, REDUNDANCY FREE NORMAL FORM
- redundancy free normal form, JOIN DEPENDENCIES—THE BASIC IDEA, A RELVAR IN BCNF AND NOT 5NF, SUPERKEY NORMAL FORM, SUPERKEY NORMAL FORM, Redundancy Revisited
- Darwen, Date, and Fagin, JOIN DEPENDENCIES—THE BASIC IDEA, SUPERKEY NORMAL FORM
- Vincent, Redundancy Revisited
- refresh, see snapshot, FIRST NORMAL FORM
- regular column, FIRST NORMAL FORM
- relation, OVERVIEW, PRELIMINARY DEFINITIONS, SIXTH NORMAL FORM, RELVARS WITH MORE THAN ONE KEY
- see also relvar, SIXTH NORMAL FORM, RELVARS WITH MORE THAN ONE KEY
- vs. relvar, OVERVIEW
- relation constant, SIXTH NORMAL FORM, RELVARS WITH MORE THAN ONE KEY
- relation equality, CHAPTER 2
- relation schema, MORE ON SUPPLIERS AND PARTS
- relation value, see relation, FDs and BCNF (Informal), EXAMPLE 9
- relation valued attribute, FIRST NORMAL FORM, EXAMPLE 10
- relation variable, see relvar, CHAPTER 4
- relational assignment, CHAPTER 4
- relvar, PRELIMINARY DEFINITIONS, DOMAIN-KEY NORMAL FORM, TWO CHEERS FOR NORMALIZATION, TWO CHEERS FOR NORMALIZATION, TWO CHEERS FOR NORMALIZATION
- predicate, see relvar predicate, TWO CHEERS FOR NORMALIZATION
- see also relation, DOMAIN-KEY NORMAL FORM
- virtual, see view, TWO CHEERS FOR NORMALIZATION
- vs. relation, TWO CHEERS FOR NORMALIZATION
- relvar constraint, DOMAIN-KEY NORMAL FORM, DATABASE DESIGN IS PREDICATE DESIGN
- the (total) relvar constraint, DATABASE DESIGN IS PREDICATE DESIGN
- relvar predicate, DATABASE DESIGN IS PREDICATE DESIGN
- RENAME, MORE ON SUPPLIERS AND PARTS, CHAPTER 2
- repeating group, FIRST NORMAL FORM
- restriction, CHAPTER 13
- RFNF, see redundancy free normal form, INDEPENDENT PROJECTIONS, Historical Notes
- Rissanen, Jorma, INDEPENDENT PROJECTIONS, Historical Notes
- Rissanen’s Theorem, INDEPENDENT PROJECTIONS
- RM/T, EXAMPLE 6
- Russell, Bertrand, CONCLUDING REMARKS
- RVA, see relation valued attribute, FUNCTIONAL DEPENDENCIES
S
- satisfy (by a relation), FUNCTIONAL DEPENDENCIES, FUNCTIONAL DEPENDENCIES, JOIN DEPENDENCIES, MULTIVALUED DEPENDENCIES (INFORMAL)
- second normal form, KEYS REVISITED, SECOND NORMAL FORM, CHAPTER 4
- two definitions, SECOND NORMAL FORM, CHAPTER 4
- Sellar, W.C., Historical Notes
- semantic vs. syntactic definition, FUNCTIONAL DEPENDENCIES
- ∈ (set membership), JOIN DEPENDENCIES—THE BASIC IDEA, AN INTRODUCTORY EXAMPLE, CHAPTER 4
- Shakespeare, William, PREDICATES AND PROPOSITIONS
- Silberschatz, Abraham, EXERCISES
- simple key, KEYS
- sixth normal form, SIXTH NORMAL FORM
- SKNF, see superkey normal form, REFINING THE DEFINITION
- Skolem, T.A., REFINING THE DEFINITION
- skolemization, REFINING THE DEFINITION
- Smith, J.M., “Restriction-union” normal form
- snapshot, 4. Use a Snapshot
- soundness, ARMSTRONG’S AXIOMS
- SQL and Relational Theory, Preface
- star schemas, WHAT DENORMALIZATION ISN’T (II)
- Steele, Richard, Database Design and Relational Theory
- Stoppard, Tom, Additional Normal Forms
- subject to, see hold, KEYS REVISITED
- subkey, KEYS REVISITED, KEYS REVISITED
- proper, KEYS REVISITED
- subset, CONCLUDING REMARKS, CONCLUDING REMARKS, CHAPTER 2, CHAPTER 2
- proper, CONCLUDING REMARKS, CHAPTER 2
- Sudarshan, S., EXERCISES
- SUMMARIZE, EXAMPLE 12
- superkey, KEYS REVISITED, KEYS REVISITED, BOYCE/CODD NORMAL FORM
- proper, KEYS REVISITED
- superkey constraint, BOYCE/CODD NORMAL FORM
- superkey normal form, SUPERKEY NORMAL FORM
- superset, CHAPTER 2, CHAPTER 2
- proper, CHAPTER 2
- surrogate, JDs IMPLIED BY KEYS, EXAMPLE 9, CHAPTER 8
- symmetry, EXAMPLE 8, RELVARS WITH MORE THAN ONE KEY, CHAPTER 13
T
- table, FIRST NORMAL FORM
- tableau, THE CHASE ALGORITHM
- TABLE_DEE, IDENTITY DECOMPOSITIONS, CHAPTER 2
- TABLE_DUM, IDENTITY DECOMPOSITIONS, CHAPTER 2
- tautology, IDENTITY DECOMPOSITIONS
- temporal data, EXAMPLE 11
- Third Manifesto, The, PREDICATES AND PROPOSITIONS
- third normal form, THIRD NORMAL FORM
- Todd, Stephen, EXAMPLE 9
- TransRelational Model, CHAPTER 8
- trivial dependency, see FD; JD; MVD, FDs and BCNF (Formal)
- tuple, PRELIMINARY DEFINITIONS, A SIMPLER EXAMPLE, CHAPTER 8
- vs. entity, CHAPTER 8
- vs. proposition, A SIMPLER EXAMPLE
- tuple equality, CHAPTER 2
- tuple forcing JD, A RELVAR IN BCNF AND NOT 5NF, REDUNDANCY FREE NORMAL FORM
- tuple generating dependency, THE CHASE ALGORITHM
- tuple ID, CHAPTER 8
- tuple projection, FDs and BCNF (Formal), CHAPTER 2
- tuple valued attribute, EXAMPLE 1
- Tutorial D, MORE ON SUPPLIERS AND PARTS
- TVA, see tuple valued attribute, EXERCISES, Historical Notes
U
- Ullman, J.D., EXERCISES, Historical Notes
- UNGROUP, EXERCISES, CHAPTER 4
- union, CHAPTER 13
- uniqueness (key), FUNCTIONAL DEPENDENCIES
- UNWRAP, EXAMPLE 1
- update anomaly, NORMALIZATION SERVES TWO PURPOSES, UPDATE ANOMALIES, AN UNFORTUNATE CONFLICT, UPDATE ANOMALIES REVISITED, CHAPTER 2
- and 5NF, UPDATE ANOMALIES REVISITED
- and BCNF, UPDATE ANOMALIES, AN UNFORTUNATE CONFLICT
- update propagation, 4. Use a Snapshot
V
- vertical decomposition, A MOTIVATING EXAMPLE
- Vianu, Victor, THE CHASE ALGORITHM
- view, RELATIONS AND RELVARS, REDUNDANCY FREE NORMAL FORM, Redundancy Revisited
- “materialized,” see snapshot, REDUNDANCY FREE NORMAL FORM, Redundancy Revisited
- Vincent, Millist W., REDUNDANCY FREE NORMAL FORM, Redundancy Revisited
- violate (by a relation), FUNCTIONAL DEPENDENCIES, FUNCTIONAL DEPENDENCIES, JOIN DEPENDENCIES, MULTIVALUED DEPENDENCIES (INFORMAL)
- virtual relvar, see view, CHAPTER 8
W
- Widom, Jennifer, EXERCISES
- WITH, MORE ON SUPPLIERS AND PARTS
- Wittgenstein, Ludwig, Prerequisites
- wrap/unwrap normal form, EXAMPLE 1
X
- XML, FIRST NORMAL FORM
Y
- Yeatman, R.J., Historical Notes
Z
- Zaniolo, Carlo, DOMAIN-KEY NORMAL FORM
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.