d

Recommendations

Info

Lex de Haan1954–2006“Tall and narrow, with a lot of good stuff on the upper floor”“A missing value”
Contents at a GlanceForeword . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xvAbout the Authors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xviiAbout the Technical Reviewers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xixAcknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xxiPreface. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xxiiiIntroduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xxvPART 1 ■ ■ ■ The Mathematics■CHAPTER 1 Logic: Introduction. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3■CHAPTER 2 Set Theory: Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23■CHAPTER 3 Some More Logic . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47■CHAPTER 4 Relations and Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67PART 2 ■ ■ ■ The Application■CHAPTER 5 Tables and Database States. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91■CHAPTER 6 Tuple, Table, and Database Predicates . . . . . . . . . . . . . . . . . . . . . . . . 117■CHAPTER 7 Specifying Database Designs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139■CHAPTER 8 Specifying State Transition Constraints. . . . . . . . . . . . . . . . . . . . . . . . 185■CHAPTER 9 Data Retrieval . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 199■CHAPTER 10 Data Manipulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 221iv
Page 1 and 2: The EXPERT’s VOIce ® in Database
Page 3: Applied Mathematics for Database Pr
Page 8 and 9: ContentsForeword . . . . . . . . .
Page 10 and 11: ■CONTENTSixQuantifiers . . . . .
Page 12 and 13: ■CONTENTSxiCommon Patterns of Tab
Page 14 and 15: ■CONTENTSxiiiPART 4 ■ ■ ■ A
Page 16 and 17: ForewordWe welcome this contributio
Page 18: About the Authors■LEX DE HAAN stu
Page 22: AcknowledgmentsThis project started
Page 26 and 27: IntroductionThis book will not try
Page 28 and 29: ■INTRODUCTIONxxviiChapter 12 summ
Page 30: PART 1The MathematicsEverything sho
Page 33 and 34: 4CHAPTER 1 ■ LOGIC: INTRODUCTIONT
Page 35 and 36: 6CHAPTER 1 ■ LOGIC: INTRODUCTION
Page 37 and 38: 8CHAPTER 1 ■ LOGIC: INTRODUCTIONv
Page 53 and 54: 24CHAPTER 2 ■ SET THEORY: INTRODU
Page 55 and 56:
26CHAPTER 2 ■ SET THEORY: INTRODU
Page 57 and 58:
Page 59 and 60:
Page 61 and 62:
Page 63 and 64:
Page 65 and 66:
Page 67 and 68:
Page 69 and 70:
Page 71 and 72:
Page 73 and 74:
Page 76 and 77:
CHAPTER 3Some More LogicAs announce
Page 78 and 79:
CHAPTER 3 ■ SOME MORE LOGIC 49Con
Page 80 and 81:
CHAPTER 3 ■ SOME MORE LOGIC 51■
Page 82 and 83:
CHAPTER 3 ■ SOME MORE LOGIC 53∃
Page 84 and 85:
CHAPTER 3 ■ SOME MORE LOGIC 55Tab
Page 86 and 87:
CHAPTER 3 ■ SOME MORE LOGIC 57Dis
Page 88 and 89:
CHAPTER 3 ■ SOME MORE LOGIC 59(
Page 90 and 91:
CHAPTER 3 ■ SOME MORE LOGIC 61In
Page 92 and 93:
CHAPTER 3 ■ SOME MORE LOGIC 63Fin
Page 94:
CHAPTER 3 ■ SOME MORE LOGIC 654.
Page 97 and 98:
68CHAPTER 4 ■ RELATIONS AND FUNCT
Page 99 and 100:
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
Page 107 and 108:
Page 109 and 110:
Page 111 and 112:
Page 113 and 114:
Page 115 and 116:
Page 118 and 119:
PART 2The ApplicationCe que l’on
Page 120 and 121:
CHAPTER 5Tables and Database States
Page 122 and 123:
CHAPTER 5 ■ TABLES AND DATABASE S
Page 124 and 125:
Page 126 and 127:
Page 128 and 129:
Page 130 and 131:
Page 132 and 133:
Page 134 and 135:
Page 136 and 137:
Page 138 and 139:
Page 140 and 141:
Page 142 and 143:
Page 144:
Page 147 and 148:
118CHAPTER 6 ■ TUPLE, TABLE, AND
Page 149 and 150:
Page 151 and 152:
Page 153 and 154:
Page 155 and 156:
Page 157 and 158:
Page 159 and 160:
Page 161 and 162:
Page 163 and 164:
Page 165 and 166:
Page 167 and 168:
Page 169 and 170:
140CHAPTER 7 ■ SPECIFYING DATABAS
Page 171 and 172:
Page 173 and 174:
Page 175 and 176:
Page 177 and 178:
Page 179 and 180:
Page 181 and 182:
Page 183 and 184:
Page 185 and 186:
Page 187 and 188:
Page 189 and 190:
Page 191 and 192:
Page 193 and 194:
Page 195 and 196:
Page 197 and 198:
Page 199 and 200:
Page 201 and 202:
Page 203 and 204:
Page 205 and 206:
Page 207 and 208:
Page 209 and 210:
Page 211 and 212:
Page 213 and 214:
Page 215 and 216:
186CHAPTER 8 ■ SPECIFYING STATE T
Page 217 and 218:
Page 219 and 220:
Page 221 and 222:
Page 223 and 224:
Page 225 and 226:
Page 228 and 229:
CHAPTER 9Data RetrievalBy means of
Page 230 and 231:
CHAPTER 9 ■ DATA RETRIEVAL 201The
Page 232 and 233:
CHAPTER 9 ■ DATA RETRIEVAL 203Lis
Page 234 and 235:
CHAPTER 9 ■ DATA RETRIEVAL 205(
Page 236 and 237:
CHAPTER 9 ■ DATA RETRIEVAL 207¬(
Page 238 and 239:
CHAPTER 9 ■ DATA RETRIEVAL 209,d.
Page 240 and 241:
CHAPTER 9 ■ DATA RETRIEVAL 211Not
Page 242 and 243:
CHAPTER 9 ■ DATA RETRIEVAL 213SEI
Page 244 and 245:
CHAPTER 9 ■ DATA RETRIEVAL 215and
Page 246 and 247:
CHAPTER 9 ■ DATA RETRIEVAL 217It
Page 248 and 249:
CHAPTER 9 ■ DATA RETRIEVAL 219•
Page 250 and 251:
CHAPTER 10Data ManipulationThrough
Page 252 and 253:
CHAPTER 10 ■ DATA MANIPULATION 22
Page 254 and 255:
Page 256 and 257:
Page 258 and 259:
Page 260 and 261:
Page 262 and 263:
Page 264 and 265:
Page 266:
Page 270 and 271:
CHAPTER 11Implementing DatabaseDesi
Page 272 and 273:
CHAPTER 11 ■ IMPLEMENTING DATABAS
Page 274 and 275:
Page 276 and 277:
Page 278 and 279:
Page 280 and 281:
Page 282 and 283:
Page 284 and 285:
Page 286 and 287:
Page 288 and 289:
Page 290 and 291:
Page 292 and 293:
Page 294 and 295:
Page 296 and 297:
Page 298 and 299:
Page 300 and 301:
Page 302 and 303:
Page 304 and 305:
Page 306 and 307:
Page 308 and 309:
Page 310 and 311:
Page 312 and 313:
Page 314 and 315:
Page 316 and 317:
Page 318 and 319:
Page 320 and 321:
Page 322 and 323:
Page 324 and 325:
Page 326 and 327:
Page 328 and 329:
Page 330 and 331:
Page 332 and 333:
Page 334 and 335:
CHAPTER 12Summary and ConclusionsYo
Page 336 and 337:
CHAPTER 12 ■ SUMMARY AND CONCLUSI
Page 338:
PART 4Appendixes
Page 341 and 342:
312APPENDIX A ■ FORMAL DEFINITION
Page 343 and 344:
Page 345 and 346:
Page 347 and 348:
Page 349 and 350:
Page 351 and 352:
Page 353 and 354:
Page 355 and 356:
Page 357 and 358:
Page 359 and 360:
Page 362 and 363:
APPENDIX BSymbolsTable B-1. Mathema
Page 364 and 365:
APPENDIX CBibliographyThis appendix
Page 366 and 367:
APPENDIX DNulls and Three (or More)
Page 368 and 369:
APPENDIX D ■ NULLS AND THREE (OR
Page 370 and 371:
Page 372 and 373:
Page 374 and 375:
Page 376 and 377:
APPENDIX EAnswers to Selected Exerc
Page 378 and 379:
APPENDIX E ■ ANSWERS TO SELECTED
Page 380 and 381:
Page 382 and 383:
Page 384 and 385:
Page 386 and 387:
Page 388 and 389:
Page 390 and 391:
Page 392 and 393:
Page 394:
Page 397 and 398:
368■INDEXclosed world assumption,
Page 399 and 400:
370■INDEXDELETE statement, 229, 2
Page 401 and 402:
372■INDEXMmanaged employees (MEMP
Page 403 and 404:
374■INDEXserialization operator,
Page 405:
376■INDEXunion operators, 101-102
show all

d

Create successful ePaper yourself

Delete template?

Save as template?