Preface | | vii | |
| The Birth of the Relational Model, Part I | | | 1 | (12) |
| | 2 | (3) |
| Codd's fundamental contributions | | | 5 | (1) |
| | 6 | (7) |
| The Birth of the Relational Model, Part 2 | | | 13 | (14) |
| | 14 | (13) |
| The Birth of the Relational Model, Part 3 | | | 27 | (12) |
| | 27 | (2) |
| Data dependencies in existing systems | | | 29 | (2) |
| | 31 | (3) |
| | 34 | (5) |
| Codd's Relational Algebra | | | 39 | (12) |
| | 40 | (2) |
| Relational algebra operations | | | 42 | (7) |
| | 49 | (2) |
| Codd's Relational Calculus | | | 51 | (14) |
| Relational calculus: an overview | | | 52 | (1) |
| Relational calculus expressions | | | 53 | (5) |
| | 58 | (1) |
| Codd's reduction algorithm | | | 59 | (2) |
| | 61 | (4) |
| Data Sublanguage ALPHA, Part 1 | | | 65 | (10) |
| | 66 | (1) |
| | 67 | (1) |
| Data definition operations | | | 68 | (1) |
| Data manipulation operations | | | 69 | (6) |
| Data Sublanguage ALPHA, Part 2 | | | 75 | (10) |
| | 76 | (3) |
| | 79 | (3) |
| | 82 | (3) |
| The First Three Normal Forms, Part 1 | | | 85 | (12) |
| | 86 | (3) |
| Advantages of further normalization | | | 89 | (1) |
| | 90 | (7) |
| The First Three Normal Forms, Part 2 | | | 97 | (8) |
| | 97 | (3) |
| Prime attributes revisited | | | 100 | (2) |
| | 102 | (2) |
| | 104 | (1) |
| Relational Really Is Different | | | 105 | (14) |
| | 106 | (4) |
| | 110 | (5) |
| | 115 | (1) |
| | 116 | (3) |
| Extending the Relational Model | | | 119 | (12) |
| Bogus vs. genuine extensions | | | 119 | (2) |
| "The object/relational model" | | | 121 | (1) |
| | 122 | (4) |
| The RM/T paper: extensions | | | 126 | (5) |
| | 131 | (10) |
| | 132 | (4) |
| So what is the relational modle? | | | 136 | (2) |
| Whither the relational model? | | | 138 | (3) |
A A Definition of the Relational Model | | 141 | (2) |
B References and Bibliography | | 143 | (6) |
Index | | 149 | |