TY  - BOOK
AU  - Codd,Edgar F.
TI  - The relational model for database management : : version 2 / 
SN  - 0201141922
PY  - 1990///
CY  - Massachusetts
PB  - Addison-Wesley
KW  - BASE DE DATOS RELACIONAL
KW  - DATA BASE MANAGEMENT
KW  - RELATIONAL DATA BASES
N1  - CONTENIDO
CHAPTER 1. Introduction to Version 2 of the Relational Model 1
1.1 What Is a Relation? 1
1.2 The Relational Model 5
1.3 The Transaction Concept 14
1.4 Classification of RM/V2 Features 15
1.5 Tables versus Relations 17
1.6 Terminology 20
1.7 Role of Language in the Relational Model 21
1.8 Keys and Referential Integrity 22
1.9 More on Terminology 26
1.10 Points to Remember 27
Exercises 27
CHAPTER 2. Structure-Oriented and Data-Oriented Features 29
2.1 Databases and Knowledge Bases 29
2.2 General Features 30
2.3 Domains, Columns, and Keys 34
2.4 Miscellaneous Features 39
Exercises 41
CHAPTER 3. Domains as Extended Data Types 43
3.1 Basic and Extended Data Types 43
3.2 Nine Practical Reasons for Supporting Domains 45
3.3 RM/V2 Features in the Extended Data Type Class 49
3.4 The FIND Commands 55
Exercises 58
CHAPTER 4. The Basic Operators 61
4.1 Techniques for Explaining the Operators 63
4.2 The Basic Operators 66
4.3 The Manipulative Operators 87
Exercises 95
CHAPTER 5. The Advanced Operators 97
5.1 Framing a Relation 98
5.2 Auxiliary Operators 103
5.3 The Outer Equi-join Operators 106
5.4 Outer Equi-joins with the MA YBE Qualifier 110
5.5 The Outer Natural Joins 113
5.6 The Outer Set Operators 115
5.7 The Inner and Outer T-join 123
5.8 The User-defined Select Operator 137
5.9 The User-defined Join Operator 138
5.10 Recursive Join 140
5.11 Concluding Remarks 143
Exercises 143
CHAPTER 6. Naming 145
6.1 Basic Naming Features 146
6.2 Naming Columns in Intermediate and Final Results 148
6.3 Naming Other Kinds of Objects 152
Exercises 153
CHAPTER 7. Commands for the DBA 155
7.1 Commands for Domains, Relations, and Columns 156
7.2 Commands for Indexes 162
7.3 Commands for Other Purposes 163
7.4 Archiving and Related Activities 166
Exercises 168
CHAPTER 8. Missing Information 169
8.1 Introduction to Missing Information 169
8.2 Definitions 171
8.3 Primary Keys and Foreign Keys of Base Relations 175
8.4 Rows Containing A-marks and/or I-marks 175
8.5 Manipulation of Missing Information 176
8.6 Integrity Rules 176
8.7 Updating A-marks and I-marks 177
8.8 Application of Equality 178
8.9 The Three-Valued Logic of RM/V1 180
8.10 The Four-Valued Logic of RM/V2 182
8.11 Selects, Equi-joins, Inequality Joins, and Relational Division 183
8.12 Ordering of Values and Marks 183
8.13 Joins Involving Value-Ordering 184
8.14 Scalar Functions Applied to Marked Arguments 185
8.15 Criticisms of Arithmetic on Marked Values 186
8.16 Application of Statistical Functions 187
8.17 Application of Statistical Functions to Empty Sets 188
8.18 Removal of Duplicate Rows 1898.19 Operator-generated Marks 191
8.20 Some Necessary Language Changes 191
8.21 Normalization 193
Exercises 194
CHAPTER 9. Response to Technical Criticisms Regarding Missing Information 197
9.1 The Value-oriented Misinterpretation 197
9.2 The Alleged Counter-intuitive Nature 198
9.3 The Alleged Breakdown of Normalization in the Relational Model 200
9.4 Implementation Anomalies 202
9.5 Application of Statistical Functions 202
9.6 Interface to Host Languages 203
9.7 Problems Encountered in the Default-Value Approach 203
9.8 A Legitimate Use of Default Values 204
9.9 Concluding Remarks 205
Exercises 206
CHAPTER 10. Qualifiers 207
10.1 The 13 Qualifiers 209
Exercises 219
CHAPTER 11. Indicators 221
11.1 Indicators Other than the View-Defining Indicators 223
11.2 The View-Defining Indicators 226
Exercises 227
CHAPTER 12. Query and Manipulation 229
12.1 Power-oriented Features 229
12.2 Blocking Commands 232
12.3 Modes of Execution 235
12.4 Manipulation of Missing Information 236
12.5 Safety Features 238
12.6 Library Check-out and Return 240
Exercises 241
CHAPTER 13. Integrity Constraints 243
13.1 Linguistic Expression of Integrity Constraints 244
13.2 The Five Types of Integrity Constraints 244
13.3 Timing and Response Specification 246
13.4 Safety Features 250
13.5 Creating, Executing, and Dropping Integrity Constraints 253
13.6 Performance-oriented Features 254
Exercises 257
CHAPTER 14. User-defined Integrity Constraints 259
14.1 Information in a User-defined Integrity Constraint 260
14.2 Condition Part of a User-defined Integrity Constraint 261
14.3 The Triggered Action 264
14.4 Execution of User-defined Integrity Constraints 264
14.5 Integrity Constraints Triggered by Date and Time 266
14.6 Integrity Constraints Relating to Missing Information 266
14.7 Examples of User-defined Integrity Constraints 268
14.8 Simplifying Features 271
14.9 Special Commands for Triggered Action 273
Exercises 274
CHAPTER 15. Catalog 277
15.1 Access to the Catalog 277
15.2 Description of Domains, Base Relations, and Views 279
15.3 Integrity Constraints in the catalog 281
15.4 Functions in the Catalog 282
15.5 Features for Safety and Performance 282
Exercises 283
CHAPTER 16. Views 285
16.1 Definitions of Views 285
16.2 Use of Views 289
16.3 Naming and Domain Features 291
Exercises 292
CHAPTER 17. View Updatability 293
17.1 Problem-oriented Definitions 296
17.2 Assumptions 297
17.3 View-updatability Algorithms VU-1 and VU-2 299
17.4 More Comprehensive Relational Requests 316
17.5 Fully and Partially Normalized Views 317
17.6 Conclusion 322
Exercises 323
CHAPTER 18. Authorization 325
18.1 Some Basic Features 327
18.2 Authorizable Actions 331
18.3 Authorization Subject to Date, Time, Resource Consumption, and Terminal 334
Exercises 336
CHAPTER 19. Functions 337
19.1 Scalar and Aggregate Functions 338
19.2 User-defined Functions 340
19.3 Safety and Interface Features 342
Exercises 344
CHAPTER 20. Protection of Investment 345
20.1 Physical Protection 345
20.2 Logical Protection 346
20.3 Integrity Protection 347
20.4 Re-distribution Protection 347
20.5 Summary of the Practical Reasons for Features RP-1-RP-5 350
Exercises 350
CHAPTER 21. Principles of DBMS Design 351
Exercises 358
CHAPTER 22. Principles of Design for Relational Languages 361
Exercises 369
CHAPTER 23. Serious Flaws in SQL 371
23.1 Introduction to the Flaws 372
23.2 The First Flaw: Duplicate Rows and Corrupted Relations 372
23.3 The Second Flaw: The Psychological Mix-up 379
23.4 The Third Flaw: Inadequate Support for Three-or Four-Valued Logic 383
23.5 Corrective Steps for DBMS Vendors 386
23.6 Precautionary Steps for Users 387
23.7 Concluding Remarks 388
Exercises 388
CHAPTER 24. Distributed Database Management 391
24.1 Requirements 391
24.2 The Optimizer in a Distributed OBMS 393
24.3 A DBMS at Each Site 394
24.4 The Relational Approach to Distributing Data 395
24.5 Distributed Integrity Constraints 406
24.6 Distributed Views 406
24.7 Distributed Authorization 407
24.8 The Distributed Catalog 408
24.9 Abandoning an Old Site 412
24.10 Introducing a New Site 414
Exercises 415
CHAPTER 25. More on Distributed Database Management 417
25.1 Optimization in Distributed Database Management 417
25.2 Other Implementation Considerations 422
25.3 Heterogeneous Distributed Database Management 424
25.4 Step by Step Introduction of New Kinds of Data 425
25.5 Concluding Remarks 425
Exercises 428
CHAPTER 26. Advantages of the Relational Approach 431
26.1 Power 432
26.2 Adaptability 432
26.3 Safety of Investment 432
26.4 Productivity 433
26.5 Round-the-Clock Operation 433
26.6 Person-to-Person Communicability 434
26.7 Database Controllability 43426.8 Richer Variety of Views 435
26.9 Flexible Authorization 435
26.10 Integratability 436
26.11 Distributability 436
26.12 Optimizability 437
26.13 Concurrent Action by Multiple Processing Units to Achieve Superior Performance 437
26.14 Concurrent Action by Multiple Processing Units to Achieve Fault Tolerance 438
26.15 Ease of Conversion 439
26.16 Summary of Advantagcs of th Relational Approach 439
Exercises 440
CHAPTER 27. Present Products and Future Improvements 441
27.1 Features: the Present Situation 441
27.2 Products Needed on Top of the Relational DBMS 443
27.3 Features of the Relational DBMS and Products on Top Assuming that the Future is Logically Based 444
27.4 Features of Relational DBMS and Products on Top, Assuming that Vendors Continue to Take a Very Short-term View 444
27.5 Performance and Fault Tolerance 444
27.6 Performance and Fault Tolerance Assuming that the Future is Logically Based 445
27.7 Performance and Fault Tolerance Assuming that the Vendors Continue to Take a Very Short-term View 445
27.8 Communication between Machines of Different Architectures 445
Exercises 446
CHAPTER 28. Extending the Relational Model 447
28.1 Requested Extensions 447
28.2 General Rules in Making Extensions 448
28.3 Introduction to the Bill-of-Materials Problem 451
28.4 Constructing Examples 451
28.5 Representation Aspects 453
28.6 Manipulative Aspects 454
28.7 Integrity Checks 455
28.8 Computational Aspects 456
28.9 Concluding Remarks 457
Exercises 457
CHAPTER 29. Fundamental Laws of Database Management 459
Exercises 466
CHAPTER 30. Claimed Alternatives to the Relational Model 467
30.1 The Universal Relation and Binary Relations 468
30.2 Why the Universal Relation Will Not Replace the Relational Model 468
30.3 Why the Binary Relation Approach Will Not Replace the Relational Model 473
30.4 The Entity-Relationship Approaches 477
30.5 The Semantic Data Approaches 478
30.6 The Object-oriented Approaches 479
30.7 Concluding Remarks 480
Exercises 481
APPENDIX A. RM/V2 Feature Index 483
APPENDIX B. Exercises in Logic and the Theory of Relations 503
References 505
Index 511
ER  -