d

Recommendations

Info

■INTRODUCTIONxxviiChapter 12 summarizes the book, lists some conclusions, and provides some generalguidelines.The book contains several appendixes:• Appendix A gives the full formal definition of the database design used in the book.• Appendix B contains a quick reference of all mathematical symbols used in the book.• Appendix C provides a reference for further background reading.• Appendix D provides a brief exploration of the use of NULLs.• Appendix E provides solutions for selected exercises.We assume that you’re aware of the existence of the relational model, and perhaps youalso have some in-depth knowledge of what this model is about (that’s not required, though).We also assume that you have experience in designing databases, and you’re therefore familiarwith concepts such as keys, foreign keys, (functional) dependencies, and the third normalform (the latter two aren’t required).This book’s main focus is on specifying a relational database design in general and specifyingthe data integrity constraints involved in such a design, specifically. We demonstrate howelementary set theory (in combination with logic) aids us in producing solid database designspecifications that give us a good and clear insight into the relevant constraints.Other authors, most notably C. J. Date in his recent book Database In Depth (O’Reilly,2005), lay out the fundamentals of the relational model but sometimes assume you are knowledgeablein certain mathematical disciplines. In this book no mathematical knowledge ispreassumed; we’ll deliver the theoretical—set-theory—concepts that are necessary to define arelational database design from the ground upwards.We must mention up front that the approach taken in this book is a different approach(for some, maybe radically different) to the one taken by other authors. The methodology thatis developed in this book uses merely elementary set theory in conjunction with logic. Elementaryset theory suffices to specify relational database designs, including all relevant dataintegrity constraints. We’ll also use set theory as the vehicle to specify queries and transactionson such designs.■Note We (the authors) are not the inventors of the methodology presented in this book. Frans Remmenand Bert de Brock originally developed this methodology in the 1980s, while they were both engaged at theEindhoven University of Technology. Appendix C lists two references of books authored by Bert de Brock inwhich he introduces this methodology to specify database designs.Database Design Implementation IssuesThe majority of all DBMSes these days are based on the ISO standard of the SQL (pronouncedas “ess-cue-ell”) language. This is where you’ll get into some trouble. First of all, the SQL languageis far from an elegant and orthogonal database language; furthermore, it is not toodifficult to see that it is a product of years of political debates and attempts to achieve consensus.
xxviii■INTRODUCTIONIn hindsight, some battles were won by the wrong guys. Indeed, this is one of the reasons whyC. J. Date and Hugh Darwen wrote their book on what they call “the third manifesto.” A fullyrevised third edition was published in 2006: Databases, Types, and the Relational Model: TheThird Manifesto (Addison-Wesley).On top of this, several database software vendors have made mistakes—sometimes smallones, sometimes big ones—in their attempts to implement the ISO standard in their products.They also left certain features out and added nonstandard features to enrich their products,thus deviating from the ISO standard. As soon as you try to step away from mathematics (andthus from the relational model) and start using an SQL DBMS, you’ll inevitably open up severalcans of worms.This book tries to stay away as much as possible from SQL, thus keeping the book as genericas possible. Chapters 9 (data retrieval) and 10 (data manipulation) display SQL expressions;they serve only to demonstrate (in)abilities of this language in comparison to the mathematicalformalism introduced in this book. Both authors happen to have extensive experiencewith the SQL DBMS from Oracle; the SQL code given in these chapters is compliant with the10g release of Oracle’s SQL DBMS. Chapter 11 (implementing database designs) displays SQLexpressions even more. We’ll also maintain the Oracle-specific content of Chapter 11; you candownload the code from the Source Code/Download area of the Apress Web site (http://www.apress.com).
Page 1 and 2: The EXPERT’s VOIce ® in Database
Page 3 and 4: Applied Mathematics for Database Pr
Page 5 and 6: Contents at a GlanceForeword . . .
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 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 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?