Авторизация
Поиск по указателям
Maier D. — The theory of relational databases
Обсудите книгу на научном форуме
Нашли опечатку? Выделите ее мышкой и нажмите Ctrl+Enter
Название: The theory of relational databases
Автор: Maier D.
Аннотация: This remarkably comprehensive new book assembles concepts and results in relational databases theory previously scattered through journals, books, conference proceedings, and technical memoranda in one convenient source, and introduces pertinent new material not found elsewhere.
The book is intended for a second course in databases, but is an excellent reference for researchers in the field.
The material covered includes relational algebra, functional dependencies, multivalued and join dependencies, normal forms, tableaux and the chase computation, representation theory, domain and tuple relational calculus, query modification, database semantics and null values, acyclic database schemes, template dependencies, and computed relations. The final chapter is a brief survey of query languages in existing relational systems. Each chapter contains numerous examples and exercises, along with bibliographic remarks.
Язык:
Рубрика: Computer science /
Статус предметного указателя: Готов указатель с номерами страниц
ed2k: ed2k stats
Год издания: 1983
Количество страниц: 637
Добавлена в каталог: 08.12.2005
Операции: Положить на полку |
Скопировать ссылку для форума | Скопировать ID
Предметный указатель
Instance, projection 340 344
Instance, universal see Universal instance
Instance, weak see Weak instance
Instantiation see Query decomposition
Instantiation, of a join plan see Join plan
int see Decomposition tree
Integrity constraint see Dependency
Intended database scheme see Database scheme
Intension see Scheme
Intensional property see Database scheme
Interactive Graphics and Retrieval System see
Interpretation, limited 244 — 247 249 254
Interpretation, limited, of a domain calculus formula 253 — 254
Interpretation, of a tuple calculus formula 238 — 239 244
Interpretation, unlimited 238 244 249 253
Interpretation, with nulls 375 — 377
Intersection see Boolean operation
Intersection graph 452 — 455 460
Intersection graph, A-path 453
Intersection graph, join graph see Join graph
Intersection graph, weight 458 — 459
Intersection graph, weight of an edge 459
Intersection property see Running intersection property
Irreducible object see Replacement system
ISBL 549 — 556 591
ISBL, assignment 552
ISBL, associativity 552
ISBL, computations on values 554
ISBL, computed relation 554 — 556
ISBL, delayed evaluation 554
ISBL, list statement 552 — 554
ISBL, operators 551 — 552
ISBL, virtual relation 554
Iteration see Query decomposition
Ito, M. 144 601
J-rule see Transformation rule
J1, J2 see Join condition
Jacobs, B, E. 286 548 601
Janssens, D. 548 605
JD see Join dependency
Johnson, D. S. 92 599
Join 16 — 22 262 276
Join completely 20 444
Join condition 203 — 207 211 216
Join condition, testing 214
Join dependency 139 — 142
Join dependency, and logic 492 — 493
Join dependency, application to a tableau see Transformation rule
Join dependency, applying to a scheme 141
Join dependency, embedded 142
Join dependency, full 220
Join dependency, implication see Implication
Join dependency, representation as a TD 497
Join dependency, satisfaction see Satisfaction
Join dependency, transformation rule see Transformation rule
Join dependency, trivial 141
Join graph 453 — 455
Join graph, join property instantiation 446
Join graph, monotone 446 — 447
Join graph, tree see Join tree
Join mapping 196 — 197
Join plan 446 — 447 (see also Increasing)
Join tree 453 460
Join tree, and full reducers 464 — 468
Join tree, and Graham reduction 464
Join tree, and MVDs 472 — 473
Join tree, and running intersection property 471
Join tree, extended scheme 467
Join tree, finding 457 — 460
Join tree, subtree 467
Join, and project 22
Join, dependency see Join dependency
Join, equijoin 29 — 31 390
Join, evaluation 290 — 293 (see also Semijoin)
Join, extension see Extension join
Join, for partial relations see Generalized relational operator
Join, generalized see Generalized relational operator
Join, graph see Join graph
Join, increasing see Increasing join property
Join, lossless 114 (see also Lossless join property)
Join, plan see Join plan
Join, project-join mapping see Project-join mapping
Join, properties 18 — 22
Join, semijoin see Semijoin
Join, simplification see Simplification
Join, small intermediate 445 — 447
Join, theta-join 33 — 34
Joinable tuples 19 — 20
Jou, J. H. 92 122 145 599 602
Kambayashi, Y. 145 370 438 548 602 608
Kameda, T. 117 122 603
Kanellakis, P. C. 194 602
Kaplan, R. S. 438 596
Kasami, T. 601
Katona, Gy. 595
Katsuno, H. 145 483 602
Kent, W. 122 437 602
Key 4 — 5 93
Key, conflict-free 482
Key, constraint see Modified foreign key constraint
Key, designated 4 93 99 104 115
Key, for MVDs 482
Key, implicit 4
Key, number in a relation 105
Key, primary 4
Key, superkey 5 99 104
Key, universal 114 — 115 176
kill see Computed relation
Kim, W. 369 — 370 591 602
King, W. F. 593 596
Klug, A. 286 370 602
Knob see Hypergraph
Korth, H. F. 438 591 603
Kreps, P. 608
Label-preserving homomorphism 503 — 504
Label-preserving homomorphism, extension 503
Lacroix, M. 392 437 603
Ladner, R. E. 437 483 601
Landers, T. A. 606
Laver, K. 484
LeDoux, C H. 122 603
Left set see Compound functional dependency
Left side see Compound functional dependency Functional
Left-reduced, FD see Functional dependency
LEFTRED 75 — 76 90
Legal formula see Domain calculus formula Tuple
levels of information see Query modification
LeViet, C. 438 603
Lewis, E., A. 92 603
Lewis, H. R. 145 549 597
Lien, Y. E. 145 437 483 603
LIMIT see Chase
Limited evaluation see Domain calculus expression Tuple
Limited interpretation see Interpretation
LINCLOSURE 65 — 68 88
Lindsay, B. G. 593 596
Linear-time closure test 65 — 68
Ling, T.-W. 117 122 603
Lipski, W. 437 549
Listable query see Computed relation
Literal, of a formula 529
Liu, L. 194 603
LJ see Lossless join property
Lochovsky, F H. 10 608
Logic, inequivalence to EMVDs and JDs 492 — 493
Logic, propositional 485 — 493
Logical connective see Connective
Lorie, R. 593 596 607
Lossles join see Join
lossless decomposition see Decomposition
Lossless join property 202 206
Lozinskii, E. L. 370 603
Lp- homomorphism see Label-preserving homomorphism
LTK normal form see Normal form
Lucchesi, C. L. 70 92 122 604
Maier, D. 70 92 194 223 370 437 483 547 591 599 604
Makowsky, J. A. 145 549 597
Mapping see Containment mapping Folding Join Project Project-join Tableau
Marek, W. 549 603
Mark 537 — 540
Marked null see Null value
Match see Tableau query
Matched symbol see Tableau query
Maximal reducer see Semijoin
Maximal scheme see Relation scheme
Maximum-weight spanning tree see Spanning tree
Maybe see Partitioned relation
Maybe equijoin see Generalized relational operator
Maybe tuple see Partitioned relation
McJones, P. R. 593
McLeod, D. 438 601
mdsb see Set basis
Mehl, J. W. 593 596
Melkanbff, M. A. 145 610
Member 65 71
Membership test see Closure
Men see Tuple variable
Mendelzon, A. O. 144 194 223 438 483 548 594 599 604
Mention set see Tuple variable
Merlin, P. M. 286 370 597
Method of evaluation see Query
MFKC see Modified foreign key constraint
MINEQ 331 — 335
Minimal disjoint set basis see Set basis
Minimal extension see Extension
Minimal object see Object
Minimize 85 — 86
Minimum conjunctive query see Conjunctive query
Minimum cover see Cover
Minimum equivalent tableau query see Tableau query
Minimum tableau query see Tableau query
Minimum tableau set query see Tableau set query
Minker, J. 286 370 599 604
Modification see Query modification
Modified foreign key constraint 421 — 422
Modify operation see Update
Monotone join plan see Join plan
Monotonic expression see Algebraic expression
Monotonicity see Project-join mapping
Multirelation tableau query see Tableau query
Multivalued dependency 124 — 137
Multivalued dependency, and acyclic database schemes 473 — 475
Multivalued dependency, and FDs 127 — 129 132
Multivalued dependency, and join tree 472 — 473
Multivalued dependency, and logic 485 489
Multivalued dependency, applying to a scheme 136
Multivalued dependency, as propositional formula 489
Multivalued dependency, conflict-free 482
Multivalued dependency, counting function 126 — 127
Multivalued dependency, decomposition under see Decomposition
Multivalued dependency, dependency basis 134 — 135 180 481
Multivalued dependency, embedded 142 476
Multivalued dependency, embedded MVDs and logic 492 — 493
Multivalued dependency, enforceable 137 — 138
Multivalued dependency, implication see Implication
Multivalued dependency, inference axiom see Inference axiom
Multivalued dependency, key see Key
Multivalued dependency, projected 215 — 217
Multivalued dependency, properties 126 — 127
Multivalued dependency, satisfaction see Satisfaction
Multivalued dependency, testing satisfaction see Satisfaction
Multivalued dependency, trivial 125 135
Mutual dependency 548
MVD see Multivalued dependency
n-tuple see Tuple
Namibar, K K. 145 483 605
Natural characteristic set see Charac¬teristic set
Natural join see Join
nchase see Chase
Nicolas, J.-M. 548 599 605
Nijssen, G. M. 438 605
Node see Hypergraph
Node removal see Graham reduction
Nondistinguished variable see Tableau Tableau
Nonprime attribute see Attribute
NONREDUN 73 — 74
Nonredunant cover see Cover
Nonredundant tableau set query see Tableau set query
Normal form 96 — 101
Normal form, Boyce — Codd 117 — 119 138 347 424
Normal form, conjunctive 308 — 309
Normal form, disjunctive 531
Normal form, first 96 — 97
Normal form, fourth 135 — 138 215 443
Normal form, LTK 117
Normal form, project-join 140 — 142
Normal form, second 99 101
Normal form, third 99 — 104 107
Normal form, through decomposition see Decomposition
Normal form, through synthesis see Synthesis
Normal form, tight fourth 444
Normalization see Synthesis
NP-completeness 86 92 105 119 122 186 194 197 214 323 327 353 370 421 478 483
Null substitution principle 375 — 377
Null value 372 — 386
Null value, and FDs 377 — 384
Null value, and relational operators see Generalized relational operator
Null value, constraint see Existence constraint
Null value, fill-in rule 378 — 381
Null value, in tuple calculus formulas 375 — 377
Null value, marked 372 379 419
Null value, placeholder see Placeholder
Null value, substitution see Null substitution principle
o see Order notation
Object 409 — 410 412
Object, as a database scheme 409
Object, closure under intersection 429 — 432
Object, containment condition see Containment condition
Object, implicit 413
Object, minimal 435
Object, satisfaction see Satisfaction
Object-faithfulness see Faithfulness condition
Open possibility function see Possibility function
Optimal cover see Cover
Optimization see Algebraic optimization Query Tableau Conjunctive
Order dependency 549
Order notation 63
order of evaluation see Query
Ordered domain see Domain
Original variable see Tableau
Osborn, S, L. 70 92 122 370 438 604
Ozsoyoglu, M. Z. 456 483 609
P see Join plan
PAD see Padding
Padding a database 419
Paddinga relation 419
Paddinga tuple 393 408
Pairwise consistency see Consistency
Palermo, F. P. 369 605
Paolini, P. 605
Papadimitriou, C. H. 548 609
Paredaens, J. 92 370 548 605
Parker, D. S. 122 145 437 483 547 593 603 606
Parsaye-Ghomi, K. 145 548 606
Partial dependency see Functional dependency
Partial information 197 371
Partial relation 373 — 406
Partial relation, and relational algebra see Generalized relational operator
Partial relation, approximation see Approximation
Partial relation, as axioms 374 381 388
Реклама