Главная    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
Предметный указатель
Partial relation, equally strong      see Possibility function
Partial relation, equivalence      see Equivalence
Partial relation, generalizing relational operators      see Generalized relational operator
Partial relation, incomparable      389
Partial relation, partitioned      see Partitioned relation
Partial relation, permissible      377 — 379 383
Partial relation, total relations represented      see Possibility function
Partial strength      see Possibility function
Partial TD      see Template dependency
Partial tuple      see Tuple
Partitioned relation      398 — 406
Partitioned relation, approximation      see Approximation
Partitioned relation, compatible tuple      see Tuple
Partitioned relation, maybe tuple      398
Partitioned relation, redundant tuple      400
Partitioned relation, sure tuple      398
Path      see Hypergraph Intersection
PC      see Consistency
PCLOSURE      213 — 214
Pecherer, R. M.      369 606
Pelagatti, G.      370 596 605
Permissible completion      see Completion
Permissible partial relation      see Partial relation
Peterlee Relational Test Vehicle      see PRTV
Pichat, E.      122 606
Pie-In-The-Sky database system      see PITS
Pinkert, I. R.      370 607
PIQUE      415 550 583
PIQUE, *      585 — 586 588
PIQUE, compound condition      587 — 589
PIQUE, logical connective      587 — 589
PIQUE, mention set      585
PIQUE, name drop      589 — 590
PIQUE, retrieve statement      585 — 586
PIQUE, selection condition      585 — 586
PIQUE, simple condition      587
PIQUE, subquery      590 — 591
PIQUE, window function      583 — 585
Pirotte, A.      392 437 591 603 606
Pits      550 583
PITS, PIQUE      see PIQUE
PITS, Query Language      see PIQUE
PJNF      see Normal form
Placeholder      408 — 410
Placeholder, and consistency      409 — 410
Placeholder, constraint      see Object
POSS      see Possibility function
Possibility function      372 386
Possibility function, and join      22
Possibility function, and select      16
Possibility function, Biskup’s      398 — 406
Possibility function, close extension      396 — 397
Possibility function, closed      388 396
Possibility function, duplicate elimination      550
Possibility function, for partial relations      see Generalized relational operator
Possibility function, generalized      see Generalized relational operator
Possibility function, minimal extension      398
Possibility function, open      388 394
Possibility function, project-join mapping      see Project-join mapping
Possibility function, pushing      see Algebraic optimization
Possibility function, reasonable      388
Possibility function, simplication      see Simplification
Possibility function, strength relationship      387 389 399 401
Possibility function, total      419 — 420
PR      see Preservation condition
Precise operator      see Generalized relational operator
pres      see Preserved set
Preservation condition      205 — 206 (see also Information preservation condition)
Preserved set      208 — 210
Price, R.      370 603
Price, T. G.      593 596 607
Primary key      see Key
Prime attribute      see Attribute
Program, for an algebraic expression      see Query decomposition
project      15 — 16 262 276
Project mapping      195 — 196
Project-join mapping      21 — 22 146 205 208
Project-join mapping, containment      see Containment
Project-join mapping, equivalence      see Equivalence
Project-join mapping, fixed-point      see Fixed-point
Project-join mapping, idempotence      147
Project-join mapping, monotonicity      147
Project-join mapping, representation with tableaux      151 — 155
Project-join normal form      see Normal form
Projected constraints      see Dependency
Projectivity      see Inference axiom
Property S      207
Propositional logic      see Logic
PRTV      550 — 551 591
PRTV, ISBL      see ISBL
Pseudotransitivity      see Inference axiom
Pushing operations      see Algebraic optimization
Putzolu, F.      593 596
QBE      533 549 568 591
QBE, aggregate operator      577 — 578
QBE, arithmetic expressions      576 — 577
QBE, condition box      575 — 576
QBE, constant      569
QBE, duplicate elimination      570 578
QBE, grouping in aggregate operators      578 — 579
QBE, last level      582 — 583
QBE, level operator      580 — 583
QBE, maximum level      582
QBE, multiple rows      571 — 572
QBE, multiple skeletons      574
QBE, naming columns in output      578
QBE, negation of a row      572 — 573
QBE, omission of variables      569 — 570
QBE, ordering output      576
QBE, print operator      569 572
QBE, quantification of variables      569
QBE, result skeleton      574 — 575
QBE, selection condition      570 — 573
QBE, set of values      577
QBE, skeleton      568
QBE, substring matching      573
QBE, transitive closure      579 — 583
QBE, union      571 — 572
QBE, variable      569
Quantifier      see Connective
QUEL      307 318 370 550 556 591
QUEL, aggregate operator      559
QUEL, arithmetic expressions      558
QUEL, assignment      558
QUEL, duplicate elimination      559
QUEL, grouping in aggregate operators      560 — 561
QUEL, qualification in aggregate operators      559 — 561
QUEL, range statement      556
QUEL, renaming attributes      557
QUEL, retrieve statement      556
QUEL, selection condition      556 — 558
QUEL, target list      556
Query      224
Query decomposition      307 — 322
Query decomposition, algorithm      315 — 322
Query decomposition, heuristics      319 — 320
Query decomposition, instantiation      310 — 313
Query decomposition, iteration      310 313
Query decomposition, multiple-relation instantiation      318
Query decomposition, simple edge      see Connection graph
Query decomposition, tuple substitution      313
Query language      224 (see also ISBL PIQUE QBE QUEL SQL)
Query language, practical considerations      550
Query modification      287 — 293
Query modification, common subexpression      see Common subexpression
Query modification, conjunctive query      see Conjunctive query
Query modification, decomposition      see Query decomposition
Query modification, for distributed databases      353 — 361
Query modification, for joins      353 — 359
Query modification, fragments of relations      see Fragment
Query modification, levels of information      293 — 295
Query modification, of joins      290
Query modification, optimization      289 — 290
Query modification, optimizing algebraic expressions      see Algebraic optimization
Query modification, semijoin      see Semijoin
Query modification, simplification      see Simplification
Query modification, tableau query      see Tableau optimization
Query modification, under dependencies      290 294
Query system      224 (see also Conjunctive query Domain Relational Tableau Tuple
Query system, calculus complete      226 — 227 527 551
Query system, completeness      see Completeness
Query system, equally expressive      226
Query system, equivalence      see Equivalence
Query system, expressive power      226 — 227
Query, equivalence      see Equivalence
Query, evaluation      see Query decomposition
Query, method of evaluation      291 — 293
Query, modification      see Query modification
Query, optimization      see Query modification
Query, order of evaluation      291
Query, simplification      see Simplification
Query-by-example      see QBE
RAM model      63
Random access machine      63
RAP-derivation sequence      see Derivation sequence
Re      see Graham reduction
Reasonable possibility function      see Possibility function
red      see Hypergraph
Reduce      77 90
Reduced CFD      see Compound functional dependency
Reduced cover      see Cover
Reduced FD      see Functional dependency
Reduced hypergraph      see Hypergraph
Reduced minimum cover      see Cover
Reduction      see Domain relational calculus Relational Subsumption Tuple
Reduction, full      see Full reduction
Redundancy, data      98 123 147
Redundancy, data, testing for      see Functional dependency
Redundant      73
Redundant tuple      see Partitioned relation
Reeve, C. L.      600 606
Reflexivity      see Inference axiom
Reisner, P.      596
Reiter, R.      437 606
REL      373
Relation      1 — 2 (see also Instance)
Relation scheme      2
Relation scheme, applicable FD      see Functional dependency
Relation scheme, applicable JD      see loin dependency
Relation scheme, applicable MVD      see Multivalued dependency
Relation scheme, avoidable attribute      see Attribute
Relation scheme, decomposition      see Decomposition
Relation scheme, domain      see Domain
Relation scheme, embodied FD      see Functional dependency
Relation scheme, FD over      49
Relation scheme, indirectly enforceable FD      see Functional dependency
Relation scheme, maximal      435
Relation scheme, normal form      see Normal form
Relation scheme, normalization      see Decomposition Synthesis
Relation scheme, removable attribute      see Attribute
Relation scheme, row over      see Row
Relation scheme, subscheme      see Subscheme relation
Relation scheme, synthesis      see Synthesis
Relation, arbitrary      506
Relation, Armstrong      50
Relation, augmenting another relation      373 — 374 381
Relation, base      287
Relation, close extension      see Extension
Relation, completion      see Completion
Relation, computed      see Computed relation
Relation, constant      26 — 27 262 276
Relation, decomposition      see Decomposition
Relation, derived      see Window function
Relation, empty      295
Relation, extending another relation      see Extension
Relation, extension      see Extension join
Relation, fixed-point      see. Fixed-point
Relation, fragmented      see Fragment
Relation, full reduction      see Full reduction
Relation, graph      see Graph
Relation, horizontal decomposition      see Decomposition
Relation, incomparable      see Partial relation
Relation, infinite      506 — 509
Relation, minimal extension      see Extension
Relation, normal form      see Normal
Relation, padding      see Padding
Relation, partial      see Partial relation
Relation, partitioned      see Partitioned relation
Relation, procedural extension      535
Relation, satisfaction of dependencies      see Satisfaction
Relation, scheme      see Relation scheme
Relation, small      319
Relation, state      4
Relation, stored extension      535
Relation, subscheme      see Subscheme relation
Relation, tableau query against      see Tableau query
Relation, tabular      see Tabular relation
Relation, total      373 — 374
Relation, truth assignment      see Truth assignment
Relation, two-tuple      see World of two tuple relations
Relation, updates      see Update
Relation, virtual      287 534 554
Relation, with inhomogeneous tuples      408
Relation, with nulls      see Null value Partial
Relational algebra      34 — 37 224
Relational algebra, and transitive closure      528 — 533
Relational algebra, extensions      533 550
Relational algebra, identity      see Identity
Relational algebra, limitations      527 — 533
Relational algebra, query modification      see Query modification
Relational algebra, reduction from domain calculus      257 — 261
Relational algebra, reduction to tuple calculus      242 — 244 247
Relational algebra, restrictions      550
Relational algebra, with complement      36 242
Relational algebra, with partial relations      see Generalized relational operator
Relational algebra, with restricted operators      36 — 37 226
relational calculus      see Domain relational calculus Tuple
Relational database      see Database
Relational operator      see Boolean operation Divide Factor Join Project Renaming Restrict Select Split
Relational operator, aggregate      see Aggregate operator
Relational operator, associativity      see Associativity
Relational operator, commutativity      see Commutativity
Relational operator, distributivity      see Distiibutivity
Relational operator, fixed-point      see Fixed-point operator
Removable attribute      see Attribute
Renaming attributes      27 — 29 408
Renaming variables      see Chase Tableau
rep      see Tableau
Replacement system      168 — 169
Replacement system, finite      168
Replacement system, irreducible object      168
Replication      see Inference axiom
Representation set      see Tableau
Representation, adequate      195 — 207 210
Representation, condition      see Independent components condition Information Join Lossless Preservation Property
Representation, of database schemes      195 — 221
Representation, of total relations by partial relations      see Possibility function
Representation, testing if adequate      210 — 217
Representation, unique      199
REPUGNANT      91
restrict      290
Restricted algebraic expression      268 — 275
Restricted expression      see Algebraic expression
Restricted FDs      see Functional dependency
Restricted operator      see Generalized relational operator
Restriction, of GFD      see Generalized functional dependency
Restriction, of TDs      see Template dependency
Right side      see Compound functional dependency Functional
Right-reduced FD      see Functional dependency
RIGHTRED      76 90
1 2 3 4 5 6 7
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте