Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Maier D. — The theory of relational databases
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.


Язык: en

Рубрика: Computer science/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1983

Количество страниц: 637

Добавлена в каталог: 08.12.2005

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Containment, constraint, of tableau queries      323 — 325 335
Containment, constraint, of tableau queries under dependencies      336 — 337
Containment, constraint, of tableau set queries      348 — 350
Containment, constraint, of tableaux      152 — 154 158 184 209 217
Containment, constraint, of tableaux under dependencies      174 — 175
Containment, constraint, on a set of relations      160 — 161
Containment, constraint, under dependencies      161 217
Conventions      4 495
Cooper, E, C.      591 598
correctness      see Inference axiom
Corresponding row      see Row
Counting function      see Multivalued dependency
Cover, annular      88 — 90 107 109
Cover, canonical      77 — 78
Cover, CFDs      87 — 90
Cover, computing minimum cover      84 — 86
Cover, for a set of FDs      71 — 72
Cover, for restricted FDs      214
Cover, minimum      79 — 86 89 109
Cover, nonredundant      72 — 74 88 218
Cover, optimal      86
Cover, reduced      74 — 77 89
Cover, reduced minimum      86
Cover, structure      78 — 84
CYCLE      see Hypergraph
Cyclic database scheme      452
Cyclic hypergraph      see Hypergraph
Cyclic transformation      478
DAG (directed acyclic graph)      see Derivation DAG Expression
DAG DDERIVES      85
DASH      see Placeholder
Data dependency      see Dependency
Data redundancy      see Redundancy
Data-equivalence      208 — 210
Data-equivalence, testing      217 — 221
Database      93 — 96 (see also Normal form)
database design      407
Database scheme      93 — 96
Database scheme, acyclic      see Acyclic database scheme
Database scheme, applicable FD      see Functional dependency
Database scheme, applicable JD      see Join dependency
Database scheme, applicable tableau query      see Tableau query
Database scheme, applicable, MVD      see Multivalued dependency
Database scheme, as a hypergraph      448
Database scheme, as objects      see Object
Database scheme, avoidable attribute      see Attribute
Database scheme, complete      107
Database scheme, conditions on      see Representation
Database scheme, covering another scheme      152 — 154 442
Database scheme, cyclic      see Cyclic database scheme
Database scheme, data-equivalence      see Data-equivalence
Database scheme, decomposition      see Decomposition
Database scheme, enforceable FD      see Functional dependency
Database scheme, enforceable MVD      see Multivalued dependency
Database scheme, equivalence      see Equivalence
Database scheme, extensional properties      439 — 447
Database scheme, FDs characterized      see Functional dependency
Database scheme, FDs represented      see Functional dependency
Database scheme, FDs restricted to      see Functional dependency
Database scheme, fixed-points      see Fixed-points
Database scheme, Graham reduction      see Graham reduction
Database scheme, image      see Image
Database scheme, independence      see Independence
Database scheme, indirectly enforceable FD      see Functional dependency
Database scheme, intended      220 — 221
Database scheme, intensional properties      447 — 455
Database scheme, join mapping      see Join mapping
Database scheme, mapping properties      439 — 455 (see also Representation)
Database scheme, modification      430
Database scheme, normal form      see Normal form
Database scheme, normalization      see Decomposition Synthesis
Database scheme, preserved set      see Preserved set
Database scheme, project mapping      see Project
Database scheme, removable attribute      see Attribute
Database scheme, representation      see Representation
Database scheme, syntactic conditions      447 — 455
Database scheme, synthesis      see Synthesis
Database scheme, tableau for      see Tableau
Database scheme, unenforceable FD      see Functional dependency
Database scheme, uniqueness condition      see Uniqueness condition
Database scheme, weight      457 459
Database, consistency of a state      see Consistency
Database, containment condition      see Containment condition
Database, distributed      353 — 354 439
Database, full reduction relative to      see Full reduction
Database, key constraint      see Modified foreign key constraint
Database, obeying FDs      see Functional dependency
Database, padding      see Database
Database, pairwise consistent      see Consistency
Database, partial information      see Partial information
Database, projection of a common instance      340 344 416;
Database, reduction      see Full reduction Semijoin
Database, representation      see Representation
Database, satisfaction of FDs      see Satisfaction
Database, scheme      see Database scheme
Database, semantics      406 — 408
Database, tableau query against      see Tableau query
Database, totally consistent      see Consistency
Database, weak instance      see Weak instance
Date, C. J.      10 598
Daya, M.      438 594
Dayal, U.      122 596 598
DCLOSURE      116 — 117
DDAG      see Derivation
de Morgan’s laws      309
DeBra, P.      370 605
Decidability      see Implication
Decidable query      see Computed relation
Decompose losslessly      see Decomposition
Decomposition      101 — 106 135 443
Decomposition tree      476 — 477
Decomposition tree, interior node      476
Decomposition, 4NF      443 — 444
Decomposition, and acyclic database schemes      474 — 477
Decomposition, for normalization      101 — 104
Decomposition, horizontal      359
Decomposition, information preserving      201
Decomposition, into independent components      199
Decomposition, lossless      21 101 113 126 139 147 443
Decomposition, of queries      see Query decomposition
Decomposition, shortcomings      104 — 106
Decomposition, tight      443 — 444 473
Decomposition, tree      see Decomposition tree
Decomposition, two-way      443
Decomposition, under MVDs      444
Decomposition, unique      443 — 444 460 476
Definiteness      see Tuple
Delete operation      see Update
Delobel, C.      70 122 144 194 547 549 593 598 606
Demers, A.      194 603
Demetrovics, J.      70 595
DEP      see Multivalued dependency
Dependency      see Existence constraint Modified
Dependency basis      see Multivalued dependency
Dependency, computed      see Computed dependency
Dependency, containment under      see Containment
Dependency, enforcing      288
Dependency, equivalence under      see Equivalence
Dependency, functional      see Functional dependency
Dependency, generalized functional      see Generalized functional dependency
Dependency, global satisfaction      see Satisfaction
Dependency, join      see Join dependency
Dependency, multivalued      see Multivalued dependency
Dependency, projected constraints      210 — 211 493 524
Dependency, template      see Template dependency
Dependent FD      see Functional dependency
Derivation DAG      56 — 62 423
Derivation DAG, for an FD      56
Derivation DAG, initial node      56
Derivation DAG, splicing      61
Derivation DAG, use set      56 — 57
Derivation rule      see Inference axiom
Derivation sequence      51 — 55 58
Derivation sequence, RAP      53 — 55
Derivation sequence, use set      52
Derivation tree      70
Derivation, from a set of FDs      51 — 62
DERIVE      49
Derives      72 88
Designated key      see Key
Determination, direct      see Direct determination
Determining set      see Computed relation
Difference      see Boolean operation
Direct determination      79 — 82
Direct image      see Image
Disjunctive normal form      see Normal form
Distinguished variable      see Tableau Tableau
Distributivity, of connectives      see Connective
Distributivity, of operations      14 — 15 22 302
Divide      25 — 26
DNF      see Normal form
DOM      see Domain
Domain      2
Domain calculus expression      253 — 255 278 528
Domain calculus expression, evaluation      253 — 255
Domain calculus expression, limited evaluation      257 261
Domain calculus expression, safe      254 — 255 257 278 550
Domain calculus expression, unlimited evaluation      253 — 255 257
Domain calculus expression, value      253
Domain calculus formula      251 — 253
Domain calculus formula, atom      251
Domain calculus formula, connective      see Connective
Domain calculus formula, substitution for variables      252
Domain calculus formula, truth      253 — 255
Domain relational calculus      224 250 550
Domain relational calculus, completeness      see Completeness
Domain relational calculus, domain variable      see Domain variable
Domain relational calculus, expression      see Domain calculus expression
Domain relational calculus, reduction from tuple calculus      255 — 257
Domain relational calculus, reduction to relational algebra      257 — 261
Domain variable      250
Domain variable, bound occurrence      251 — 252
Domain variable, free occurrence      251 — 252
Domain variable, substitution      252
Domain variable, type      251 — 252
Domain, active      11
Domain, extended active      245 254
Domain, finite      384 542
Domain, infinite      49 542
Domain, non-numeric      235
Domain, of a relation scheme      11 236 245
Domain, of an attribute      2 11 245 254 258
Domain, ordered      31
Domain, quoting values      235
Domain, special values      371 — 372
Dowd, M.      70 594
Downey, P. J.      194 598
EC      see Existence constraint
echase      see Chase
EDGE      see Hypergraph
Edge removal      see Graham reduction
EDOM      see Domain
EID      see Embedded implicational dependency
EJD      see Join dependency
Elimination requirement      see Fragmentation scheme
Embedded FD      see Functional dependency
Embedded implicational dependency      548
Embedded JD      see Join dependency
Embedded MVD      see Multivalued dependency
Embodied FD      see Functional dependency
Empty relation      see Relation
EMVD      see Multivalued dependency Enforceable
Enforceable MVD      see Multivalued dependency
Entity class      407
Epstein, R.      370 598
Equality generating dependency      548 — 549
equijoin      see Join
EQUIV      72 88
Equivalence classes of FDs      78 — 84 108
Equivalence, data      see Data-equivalence
Equivalence, database scheme      152 — 155
Equivalence, of a JD to MVDs      442 — 443 460
Equivalence, of algebraic expressions      242 — 244
Equivalence, of CFDs      87
Equivalence, of conditions on database schemes      455 — 478
Equivalence, of conjunctive queries      351 — 353
Equivalence, of database schemes      208 210
Equivalence, of FDs to GFDs      517
Equivalence, of fixed-points      217
Equivalence, of JDs to TDs      497
Equivalence, of logical implication and dependency implication      487 — 492
Equivalence, of minimum simple queries      328 333
Equivalence, of partial relations      373 — 374 387
Equivalence, of queries      225 — 226 242
Equivalence, of query systems      225 — 227
Equivalence, of relational algebra and calculus      242 — 244 247 255 308
Equivalence, of relational algebra and tableau queries      268 — 275
Equivalence, of relational expressions      225 — 226
Equivalence, of sets of attributes      78 — 79
Equivalence, of sets of FDs      71 — 72
Equivalence, of simple tableau queries      327 — 335
Equivalence, of tableau      152 — 156 160 208 210
Equivalence, of tableau queries      323 — 328 331 333
Equivalence, of tableau queries under dependencies      335 — 347
Equivalence, of tableau set queries      348 — 350
Equivalence, of tableau under dependencies      174 — 175
Equivalence, of TDs      497
Equivalence, on a set of relations      160 — 161
Equivalence, test for      72
Equivalence, testing      210 — 221
Equivalence, under dependencies      161 210
Eswaran, K. P.      369 593 596
Evaluation strategy      see Query decomposition
Evaluation, of a query      see Domain calculus expression Join Query Tableau Tuple
Evaluation, of a tableau query      see Tableau query
Evaluation, of an expression      see Domain calculus expression Tuple
ex      see Join tree
Existence constraint      372 384
Existential quantifier      see Connective
Expression      see Algebraic expression Domain Tuple
Expression DAG      296 — 297
Expression tableau query      see Tableau query
Expression tree      296
Expressive power      see Query system
Extended active domain      see Domain
Extended scheme      see Join tree
Extension      see Database Relation
Extension chase      see Chase
Extension join      341 — 346
Extension join, $R_{F}$-extension      341
Extension join, computing with the chase      342 — 346
Extension join, extension of a relation      341
Extension, close      387 — 388 396
Extension, minimal      387 — 388 398
Extension, of a relation      373 388 397
Extension, of a tuple      373
Extensional property      see Database scheme
Exterior      see Functional dependency
Externally dependent attribute      see Attribute
Extraneous attribute      see Attribute
F-rule      see Transformation rule
Factor      38 — 39
Fadous, R.      70 599
Fagin, R.      41 122 141 144 483 547 594 599 607
Faithful operator      see Generalized relational operator
Faithfulness condition      413 421 427
Faithfulness condition, FCR      see Finite Church — Rosser property
Faithfulness condition, FD      see Functional dependency
Faithfulness condition, Fill-in rule      see Null value
Faithfulness condition, Finite Church — Rosser property      168 — 174
1 2 3 4 5 6 7
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте