Index

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.

Symbols Abiteboul, Serge, 236 Adamson, Chris, xix, 170 → (FD arrow), 32 Adiba, Michel, 376 →→ (MVD double arrow), 244 Aho, A.V., 439 ☼ (JD star), 188 ALL BUT, 48 ⋈ (bow tie), 188 all key, 75 ∈ (set membership), 111, 188, 243 alternate key, 12, 418 ⇒ (logical implication), 263 AND (aggregate operator), 34, 89, 325 ⊆ (subset of), 38 arity, 27 ⊂ (proper subset of), 38 Armstrong, Louis, 3 Armstrong, W.W., 146, 439 Numerals Armstrong’s axioms, 146 0‑tuple, see empty tuple “arrow out of,” 73 1NF, see “atomic fact,” 289 2NF, see atomicity (data), 94 3NF, see attribute 3NF procedure, 129–133 attribute-name / type-name pair, 26 (3,3)NF, 312 valued, see relation valued 4NF, see attribute 5NF, see tuple valued, see tuple 6NF, see valued attribute attribute renaming, see RENAME axiomatization A FDs, 147 Abbey, Edward, 29 MVDs, 250 Abbott, Bud, 241 not for JDs, 236

443 © C. J. Date 2019 C. J. Date, Design and Relational Theory, https://doi.org/10.1007/978-1-4842-5540-7 Index B completeness, 146 component (JD), 187 Bacon, Francis, 145 composite key, 11 base relvar, 25 compound BCNF, see Boyce/Codd normal form predicate, 289 BCNF procedure, 133–134 connection trap, 191 Beeri, Catriel, 439 connective, 289 Bennett, Alan, 417 consistency (database), 404–416 Betjeman, John, 393 consistency (dependencies), 282 body CONSTRAINT, 33 relation, 26, 98 constraint, 57 relvar, 99 checked immediately, 415–416 bound variable, 379 see also single-relvar constraint; Boyce, Raymond F., 81 multirelvar constraint Boyce/Codd normal form, contain vs. include, 38 68, 79–80, 102–105 contradiction, 136, 326, 333 explanation of name, 81 Costello, Lou, 241 Brown, Robert R., 15 cover (FDs), 130 business rule, 120, 402–403 CWA, see Closed World Assumption cyclic rules, 194 C , 10, 74 canonical form, 61 D cardinality, 27 D, 31 Carroll, Lewis, 287, 349 D_UNION, 369 Casanova, Marco A., 440 da Vinci, Leonardo, 15 catalog, 71, 91, 420 Darling, David, 319 chase algorithm, 231–235 Darwen, Hugh, passim Churchill, Winston, 307 Darwen’s Theorem, 153 Closed World data model Assumption, 30, 256 first sense, 7–8 closure second sense, 7–8 relational algebra, 43 database set of attributes, 85, 151–153 logical system, 408–410 set of FDs, 147 database professional, 23 Codd, E. F., passim Date, C. J., passim commalist, 10 DB2, 167 common sense, 14–15 DBMS, xviii

444 Index decomposition, see nonloss E decomposition E-relvar, 363 degree, 27 E/R modeling, xviii, 357 deletion anomaly EKNF, see elementary key normal form and FDs, 54 elementary key, 310 and JDs, 214 elementary key normal form, 310–311 generic, 309 Elmasri, Ramez, 84 , 161ff embedded dependencies, 251–252, 281 considered harmful, 172ff empty key, 36, 42 increasing empty restriction, 136 redundancy, 164–165 empty sequence, 10 dependency, 32 empty set of parameters, 36, 42 explicit, see explicit dependency empty tuple, 36, 39, 42 implicit, see implicit dependency entity integrity, 419 dependency preservation, 117ff entity/relationship modeling, ETNF vs. 5NF, 273 see E/R modeling MVDs, 249 entity supertype/subtype, 433 dependant equality, 40 FD, 72, 100 relation, see relation equality MVD, 246 tuple, see tuple equality derived data, 372, 373, 377 equality dependency, 52, 58–60 design process, xvii–xviii, 398 equality generating dependency, 231 designator, 409 EQD, see equality dependency determinant equivalence FD, 72, 100 information, see information equivalence MVD, 246 JDs, 222 Dickinson, Emily, 201 sets of FDs, 154 Dijkstra, Edsger W., iii, 407 essential, 275 dimension table, 171 essential tuple normal form, 268–275 DISJOINT, 343 choice of name, 274–275 DK/NF, see domain-key normal form essentiality, 275 domain, 38 ETNF, see essential domain constraint (DK/NF), 308 tuple normal form domain-key normal ETNF vs. RFNF vs. SKNF, 287 form, 273, 308–310 “eventual consistency,” 405-406 double underlining, 11, 80, 83, 92 explicit dependency, 230 duplicate tuples, 330 EXTEND, 373 see also tuple equality

445 Index F GROUP, 93, 359 group-ungroup normal form, 359 , 171 factorial, 90 Fagin, Ronald, passim H Fagin’s Theorem, 247 Fallacy of False Conversion, 165 Hall, Patrick, 370 FD, 32, 33, 72, 100–102 Hamdan, Sam, 163 axiomatization, 147 heading, 26, 98 of a relvar, 101 Heath, Ian J., 107–109, 438 implied by a superkey, 104 Heath notation, 145 not a JD, 212 Heath’s Theorem, 105–109 trivial, 73, 102 extended version, 237 FD graph, 136–137 Helskyaho, Heli, 393 FD redundant, 269 Hesiod, iii fifth normal form, 204–206 hierarchic structure, see relation not necessarily redundancy valued attribute free, 195–196 hold (in a relvar) first normal form, 65–68 FD, 101 DB2, 167 JD, 203 relation, 66 MVD, 246 relvar, 67 U_JD, 299 violating, 69–72 horizontal decomposition, foreign key, 12 135, 167–168, 324ff fourth normal form, 248–249 Howard, John H., 439 per Boyce, 81 Hull, Richard, 236 Frege, Gottlob, 357 fully redundant tuple, 274 function, 33 I functional dependency, see FD IDENTICAL, 291, 365 see also Boyce/Codd normal form identity decomposition, 134–136 further normalization, 48 identity projection, 134 identity restriction, 135 image relation, 373 G implicit dependency, 230 Garcia-Molina, Hector, 84 implied by keys Gehrke, Johannes, 84 FD, 104 “getting rid of” JD, 205, 207–211 (constraints), 105 MVD, 248 446 Index implied by superkeys, trivial, 204 see implied by keys see also fifth normal form; sixth normal IMS, 68 form include vs. contain, 38 JD redundant, 269 inclusion dependency, 59 join, 99 inconsistency, 326, 355, 404 generalized, see U_join IND, see inclusion dependency of no relations, 111 independent projections, 137–138 of one relation, 111 information equivalence, , see JD 49, 62, 178, 298 joinable, 99 Information Principle, 37 SQL violations, 37 insertion anomaly K and FDs, 54 KCNF, see key complete normal form and JDs, 214 key, 10–12, 103 generic, 309 key attribute, 74 instance, see relation schema key constraint, 32, 103 instantiation, 29–30, 401 key complete normal form, 278 integrity constraint, see constraint Kimball, Ralph, 172 intended interpretation, 28, 356 Korth, Henry F., 84 interval, 291ff irreducibility cover, 131 L “fact,” 289 logical vs. physical design, xvii, 12, FD, 76, 103 398–399 JD, 224–229 Lorentzos, Nikos A., xiii, 170, 287, 372, 441 key, 74 losing dependencies, see dependency relvar, 288 preservation irrelevant component (JD), 222 lossless decomposition, see nonloss IS_EMPTY, 142, 340 decomposition lossy decomposition, 106 lossy join, 50 J JD, 186–190, 201–204 generalized, see U_JD M implied by FD, 212 Maier, David, 231 implied by superkeys, 205 “materialized view,” 350 of a relvar, 203 McGoveran, David, xviii, 441

447 Index Melzak, Z.A., 65 O membership algorithm, 207 Occam’s Razor, 421 Mendelzon, Alberto O., 231 Open World Assumption, 39–40 minimal lossless Oram, Andy, xviii decomposition, 279 orthogonal decomposition, 341 missing information, 291, 339 orthogonality, 319ff modification anomaly, 54 connection to normalization, 336 multiple assignment, 355 see also Principle of multirelvar constraint, 58 Orthogonal Design multivalued dependency, see MVD overstrong PJ/NF, 311 MVD, 242–247 OWA, see Open World Assumption implied by superkey, 248 Owlett, John, 370 shorthand notation, 254, 259 trivial, 247 see also fourth normal form P P-relvar, 363 PACK, 293 N packed form, 293 n pick r, 218 Papadimitriou, Christos H., 440 naming recommendation, 332 partly redundant tuple, 274 natural join, see join Pascal, Fabian, 372 Navathe, Shamkant B., 84 physical design, Nixon, Richard M., 62 see logical design nonkey attribute, 75 automating, xviii, 399 nonloss decomposition, 49 PJ/NF, see fifth normal form nonprime attribute, 75 PJSU/NF, 312 normal form, 54–56 PK:AK distinction, 419 normal form hierarchy, 54, 264, 314–315 PL/I, 47 normalization, 48 plausible tuple, see Closed World and constraints, 57–58 Assumption conventional procedure, 123 Polya, George, 369, 423 decreasing redundancy, 164 predicate, 24, 28–30 goals, 320 composite / compound, 289 principles, 319 conjunctive, 289 two purposes, 49–53 disjunctive, 304 normalized, 67 empty set of parameters, 42 Normann, Ragnar, 279, 441 overlapping, 326 null, 20, 35, 37, 70, 170, 413, 419 relvar, see relvar predicate

448 Index

simple, 289 “final” definition, 382 vs. constraint, 356–357 managing, 374–377 preserving dependencies, see dependency Vincent’s definition, 276 preservation redundancy free (ETNF), 270 primary key, 11, 83, 92, 92, 417ff redundancy free normal form, 275–278 prime attribute, 75 refresh, see snapshot Principle of Cautious Design, 421 regular column, 70 Principle of Interchangeability, 25, 420 relation, 98 Principle of Orthogonal Design vs. relvar, 24–26 first definition, 327 see also relvar second definition, 332 relation constant, 423 third definition, 334–335 relation equality, 40–41 fourth definition, 337 relation schema, 32 “final” definition, 338 relation value, see relation principles of normalization, relation valued attribute, 66 see normalization contraindicated, 67–68 projection, 98 relation variable, see relvar generalized, see U_projection relational assignment, 93–94 simplified notation, 59 relvar, 9 projection-join normal form, 195, 205, predicate, see relvar predicate 263, 440 virtual, see view proper subset, see subset vs. relation, 24–26 proper superset, see superset see also relation proposition, 24, 28–29, 39, 42, 378–381 relvar predicate, 24, 29 quantified, 379 RENAME, 34, 43 repeating group, 71–72 restriction, 314 Q restriction condition, 314 quantified proposition, see proposition “restriction-union” normal form, 312 quantifier, 357, 379 RFNF, see redundancy free normal form Rissanen, Jorma, 137, 439, 440 R Rissanen’s Theorem, 138 Ramakrishnan, Raghu, 84 RM/T, 363 real database, 25 RM/T discipline, 363, 430 redundancy, 14, 48, 52–53, 56, 263, Ross, Ron, 403 268, 329 Russell, Bertrand, 17, 18 controlled, 377, 389 RVA, see relation valued attribute

449 Index S subject to, see hold subkey, 75 Sagiv, Yehoshua, 231 proper, 75 satisfy (by a relation) subset, 38 FD, 101 proper, 38 JD, 203 Sudarshan, S., 84 MVD, 246 SUMMARIZE, 372–373 U_JD, 299 superkey, 75 scalar, 94 proper, 75 second normal form, 76–78 superkey constraint, 103 two definitions, 77, 87 superkey normal form, 279–280 Sellar, W.C., 437 superset, 38 semantic transformation, 413 proper, 38 semantic vs. syntactic surrogate, 168–169, 178, 180–181, 212, definitions, 103 370–371 Shakespeare, William, 29, 117 symmetry, 369 Silberschatz, Abraham, 84 simple key, 11 single-relvar T constraint, 215, 309 sixth normal form TABLE_DEE, 39, 40, 42, 111, 135, 414 regular data, 288–291 TABLE_DUM, 39, 40, 135 temporal data, 291–301 table predicate, 398, 400–401 SKNF, see superkey normal form tableau, 233 Skolem, T.A., 379 “tables and views,” 394-395 skolemization, 379 Tasmania, 363 Smith, J.M., 312 tautology, 136 snapshot, 350, 376–377 temporal data, 291–301, 372 SNF, 279 Third Manifesto, 31–32 soundness, 147 third normal form, 78–79 spurious tuple, 63, 112, 188, 193 Todd, Stephen, 370 TM SQL vs. relational TransRelational Model, xviii, 169, 180, model, 20, 23, 70 396, 399 SQL and Relational Theory, xv, xvi, 6 trivial decomposition, 196 , 170–172 trivial dependency, see FD; JD; MVD “stated or implied,” 39 tuple, 98 Steele, Richard, iii vs. entity, 180 Stevens, Wallace, 263 vs. proposition, 328–332 Stoppard, Tom, 307 tuple equality, 40–41 450 Index tuple forcing dependency, 194, 232 V tuple forcing JD, 194, 214, 269 vertical decomposition, 135, 324 tuple generating Vianu, Victor, 236 dependency, 232 view, 25, 89, 92, 199, 260, 350–351, 361, 375 tuple ID, 180–181 “materialized,” see snapshot tuple join, 41 Vincent, Millist W., 274–278, 441 tuple projection, 42, 59, 98 violate (by a relation) tuple union, 41 FD, 101 tuple valued attribute, 358 JD, 203 Tutorial D, 31–32 MVD, 246 TVA, see tuple valued attribute U_JD, 299 type constraint, 308 virtual relvar, see view

U W U_equality, 298 “well architected,” 180 U_JD, 299 Widom, Jennifer, 84 U_join, 298 WITH, 34, 176 U_projection, 297 Wittgenstein, Ludwig, 23 Ullman, J.D., 84, 439 WRAP, 359 UNGROUP, 93, 253, 359 wrap-unwrap normal form, 359 union, 314 uniqueness (key), 74 unit interval, 294 X units, 324 XML, 38, 68, 83 UNPACK, 294 unpacked form, 294 UNWRAP, 359 Y update anomaly, 53, 213–215, 243, 308 Yeatman, R.J., 437 see also deletion anomaly; insertion anomaly; modification anomaly update propagation, 377 Z user database, 25 Zaniolo, Carlo, 310

451