The Structure of the Relational Database Model: Monographs in Theoretical Computer Science. An EATCS Series, cartea 17
Autor Jan Paredaens, Paul De Bra, Marc Gyssens, Dirk van Guchten Limba Engleză Paperback – 3 oct 2013
Din seria Monographs in Theoretical Computer Science. An EATCS Series
- 20% Preț: 642.50 lei
- 20% Preț: 624.06 lei
- 20% Preț: 322.43 lei
- 20% Preț: 619.15 lei
- 20% Preț: 621.54 lei
- 20% Preț: 325.63 lei
- 20% Preț: 896.93 lei
- 20% Preț: 583.40 lei
- 20% Preț: 518.67 lei
- 20% Preț: 623.74 lei
- 20% Preț: 634.06 lei
- 20% Preț: 622.34 lei
- 20% Preț: 1403.33 lei
- 20% Preț: 637.88 lei
- 20% Preț: 317.19 lei
- 20% Preț: 327.37 lei
- 18% Preț: 913.26 lei
- 20% Preț: 741.99 lei
- 20% Preț: 795.32 lei
- 20% Preț: 977.03 lei
- 20% Preț: 956.57 lei
- 15% Preț: 620.43 lei
- 20% Preț: 618.98 lei
- 20% Preț: 955.76 lei
- 20% Preț: 618.85 lei
- 20% Preț: 622.17 lei
- 20% Preț: 620.74 lei
- 20% Preț: 612.64 lei
- 20% Preț: 511.90 lei
- 20% Preț: 605.80 lei
Preț: 319.26 lei
Preț vechi: 399.07 lei
-20% Nou
Puncte Express: 479
Preț estimativ în valută:
61.10€ • 64.46$ • 50.92£
61.10€ • 64.46$ • 50.92£
Carte tipărită la comandă
Livrare economică 02-16 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642699580
ISBN-10: 3642699588
Pagini: 248
Ilustrații: X, 233 p.
Dimensiuni: 170 x 244 x 13 mm
Greutate: 0.4 kg
Ediția:Softcover reprint of the original 1st ed. 1989
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Monographs in Theoretical Computer Science. An EATCS Series
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642699588
Pagini: 248
Ilustrații: X, 233 p.
Dimensiuni: 170 x 244 x 13 mm
Greutate: 0.4 kg
Ediția:Softcover reprint of the original 1st ed. 1989
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Monographs in Theoretical Computer Science. An EATCS Series
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
Lower undergraduateCuprins
1 Relational Database Model.- 1.1 Relation Schemes.- 1.2 Relation Instances.- 1.3 Database Schemes and Database Instances.- 1.4 Dynamic Schemes and Evolutions.- 1.5 Classification of Constraints.- 1.6 Example.- 1.7 Exercises.- 2 Query Systems.- 2.1 The Relational Algebra.- 2.2 The Tuple Calculus.- 2.3 SQL: Structured Query Language.- 2.4 Reduction of the Tuple Calculus to the Algebra.- 2.5 Reduction of the Algebra to SQL.- 2.6 Reduction of SQL to the Tuple Calculus.- 2.7 Exercises.- 3 Constraints.- 3.1 Some Terminology.- 3.2 Functional Dependencies.- 3.3 Multivalued Dependencies.- 3.4 Join Dependencies.- 3.5 Inclusion Dependencies.- 3.6 Tuple and Equality Generating Dependencies.- 3.7 Exercises.- 4 Vertical Decompositions.- 4.1 First Normal Form.- 4.2 Second and Third Normal Form.- 4.3 Boyce-Codd Normal Form.- 4.4 Constraint Preserving Normalization.- 4.5 Fourth and Fifth Normal Form.- 4.6 Vertical Decomposition and Consistency Checking.- 4.7 Exercises.- 5 Horizontal Decompositions.- 5.1 Horizontal Decompositions.- 5.2 The Membership and Inference Problem for Fds and Ads.- 5.3 The Inheritance of Dependencies.- 5.4 Normal Forms for Horizontal Decompositions.- 5.5 Exercises.- 6 Incomplete Information.- 6.1 Representation Systems for Existing-but-Unknown Nulls.- 6.2 Updating Relations with Existing-but-Unknown Nulls.- 6.3 Constraints in Incomplete Databases.- 6.4 Relations with No-Information Nulls.- 6.5 The Weak Instance Model.- 6.6 Exercises.- 7 The Nested Relational Database Model.- 7.1 Nested Relation Schemes and Instances.- 7.2 The Nested Relational Algebra.- 7.3 Constraints.- 7.4 The Expressiveness of the Nested Relational Algebra.- 7.5 Hierarchical Instances.- 7.6 Exercises.- 8 Updates.- 8.1 Transactions.- 8.2 Equivalent Transactions.- 8.3 Dynamic Relation Constraints.- 8.4 Axiomatization of Equivalence of Transactions.- 8.5 Exercises.