Главная    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
Предметный указатель
Testing for equivalent sets of FDs      see Equivalence
Testing for redundancy      see Functional dependency
Testing implication      see Implication
Testing membership in a closure      see Closure
Testing satisfaction      see Satisfaction
Theta-join      see Join
Third normal form      see Normal form third
Tight decomposition      see Decomposition
Tight fourth normal form      see Normal form
Time-complexity      63
Ting, P. D.      92 603
Todd, S. J. P.      30 41 482 549 591 601 608
Tompa, F. W.      117 122 603
Total consistency      see Consistency
Total projection      see Project
Total relation      see Relation
Total tuple      see Tuple
Tou, J. T.      608
Traiger, I. L.      593 596
Transformation relation      168
Transformation rule      162 — 164
Transformation rule, $T^{+}$-rule      513 — 514
Transformation rule, F-rule      162 — 163 187 336 347
Transformation rule, for nulls      378 — 381
Transformation rule, G-rule      518 — 520
Transformation rule, J-rule      163 — 164 187 336
Transformation rule, T-rule      510 — 513
Transformation rule,for marked nulls      380 — 381
Transitive closure      527 — 528
Transitive closure, and relational algebra      528 — 533
Transitive dependency      see Functional dependency
Transitivity      see Inference axiom
TREE      see Decomposition tree Expression Join Join Spanning
Trivial FD      see Functional dependency
Trivial GFD      see Generalized functional dependency
Trivial hypergraph      see Hypergraph
Trivial JD      see Join dependency
Trivial MVD      see Multivalued dependency
Trivial TD      see Template dependency
Truth assignment, for a relation      486 — 487
Tsichritzis, D. C.      10 608
Tsou, D. -M.      122 145 194 599 608
Tsuda, T.      370 608
Tuple      2
Tuple calculus expression      227 236 247
Tuple calculus expression, and algebraic expressions      308
Tuple calculus expression, equivalent tableau query      266
Tuple calculus expression, evaluation      240 — 242 246 307
Tuple calculus expression, limited evaluation      246 — 249 257
Tuple calculus expression, safe      247 — 249 257 550
Tuple calculus expression, unlimited evaluation      246 249 257
Tuple calculus expression, value      240 — 242 246
Tuple calculus formula      229 — 236
Tuple calculus formula, atom      230 233 237
Tuple calculus formula, connective      see Connective
Tuple calculus formula, interpretation      see Interpretation
Tuple calculus formula, legal      233 — 234
Tuple calculus formula, shorthand      234
Tuple calculus formula, substitution for variables      237
Tuple calculus formula, truth      230
Tuple calculus formula, with nulls      375 — 377
Tuple generating dependency      548 — 549
Tuple relational calculus      224 227 550
Tuple relational calculus, completeness      see Completeness
Tuple relational calculus, expression      see Tuple calculus expression
Tuple relational calculus, reduction from relational algebra      242 — 244 247
Tuple relational calculus, reduction to domain calculus      255 — 257
Tuple relational calculus, tuple variable      see Tuple variable
Tuple substitution      see Query decomposition
Tuple variable      227
Tuple variable, bound occurrence      231 — 236
Tuple variable, free occurrence      231 — 236
Tuple variable, mention set      232 — 236
Tuple variable, occurrence      234
Tuple variable, scheme      232
Tuple variable, substitution      237
Tuple variable, type      231 — 236
Tuple, agreement of partial tuples      379
Tuple, compatible      403
Tuple, constant      26 — 27
Tuple, definiteness      373
Tuple, extending another tuple      see Extension
Tuple, inhomogeneous      406
Tuple, joinable      19 — 20
Tuple, maybe      see Partitioned relation
Tuple, padding      see Padding
Tuple, partial      373
Tuple, redundant      see Partitioned relation
Tuple, subsuming another tuple      see Subsumption
Tuple, subsumption      see Subsumption
Tuple, subtuple      406 409
Tuple, sure      see Partitioned relation
Tuple, total      373
Tuple, value on an attribute      3
TYPE      see Domain variable Tuple
Typed GFD      see Generalized functional dependency
Typed TD      see Template dependency
U      see Derivation DAG use
UIA      see Universal relation assumption
Uliman, J D.      10 63 70 145 194 286 370 438 483 547 549 591 593 599 603 606 609
Unenforceable FD      see Functional dependency
union      see Boolean operation
Unique decomposition      see Decomposition
Unique representation property      199
Uniqueness condition      423 — 427
Uniqueness condition, and window functions      427
Universal instance      416
Universal instance assumption      406
Universal instance assumption, and window functions      413
Universal key      see Key
Universal quantifier      see Connective
Universal relation assumption      406 — 409
Universal relation scheme assumption      407 — 413 427
Unknown value      see Value
Unlimited evaluation      see Domain calculus expression Tuple
Unlimited interpretation      see Interpretation
Untagged tableau query      see Tableau query
Untyped TD      see Template dependency
UPDATE      5 — 8
Update system      224
Update, add      5 — 7
Update, and containment condition      411
Update, anomaly      98
Update, change      8
Update, delete      7 — 8
URSA      see Universal relation scheme assumption
Use set      see Derivation DAG Derivation
Valid fragmentation scheme      see Fragmentation scheme
Valuation, for a tableau      149 — 151
Valuation, of a row      149
Valuation, of a tableau      149
Valuation, of a tableau query      263 — 265
Valuation, of a TD      495
Value      see Tableau set query
Value, of a tableau query      see Tab¬leau query
Value, of an expression      see Domain cal¬culus expression Tuple
Value, unknown      372
Vardi, M. Y.      145 194 548 594 609
Variable      see Domain variable Tableau Tableau Tuple
Vassiliou, Y.      437 609
Vianu, V.      370 598
view      287 (see also Window function)
violation      380
Violation, hard      380 — 382
Violation, of FDs      487
Violation, of MVDs      490 — 492
Violation, of TDs      506 — 509
Violation, soft      380
Virtual relation      see Relation
Waddle, V.      438 601
Wade, B. W.      593 596
Walecka, S.      145 548 607
Walker, A.      437 — 438 609
Wang, C. P.      122 609
Warren, D S.      438 549 597 604
Watson, V.      593
Weak instance      416 — 420 424
Weak instance, C-weak instance      418
Weak instance, defining a window function      418
Weakening      see Inference axiom
Weaker chain      see Template dependency
Weakest TD      see Template dependency
Wedekind, H. H.      122 609
Weight, of a database scheme      see Database scheme
Weight, of a graph      see Intersection graph
Weight, of an attribute      see Attribute
Weight, of an edge      see Intersection graph
WI      see Weak instance
Wiederhold, G.      10 609
Window function      372 410 418 427
Window function, and UIA      413
Window function, and uniqueness condition      427
Window function, computation      420 427
Window function, containment condition      see Containment condition
Window function, faithful      see Faithfulness condition
Window function, for objects      430
Window function, in PIQUE      583 — 585
Window function, on arbitrary attributes      412
Window function, on objects      412 — 413
Window function, strong faithfulness      see Faithfulness condition
Window function, using dependencies      418 427
Window function, using join      413 — 415
Window function, weak instance      418
Winning row      see Tableau Wong C. 608
with computed relations      see Computed relation
Wong, E.      369 — 370 591 598 600 606 608
World of two-tuple relations      486 — 493
WT      see Attribute Database Intersection
Yajima, S.      145 548 603 608
Yannakakis, M.      194 286 437 483 547 594 599 601 604 607 609
Yao, S. B.      370 438 601 609
Yost, R. A.      593 596
Youssefi, K.      370
Yu, C. T.      456 483 609
Zaiddan, S. M.      223 600
Zaniolo, C.      144 — 145 393 437 610
Zloof, M. M.      568 591 610
1 2 3 4 5 6 7
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте