| C. J. DATE is an author, lecturer, researcher, and independent consultant specializing in relational database systems. An active member of the database community for nearly 35 years, C. J. Date devotes the major part of his career to exploring, expanding, and expounding the theory and practice of relational technology. He enjoys a reputation second to none for his ability to explain complex technical material in a clear and understandable fashion.. << 查看详细 |
| parti preliminarie s 1 chapter 1 an overview of database management 3 1.1 introduction 3 1.2 what is a database system? 6 1.3 what is a database? 11 1.4 why database? 16 1.5 data independence 20 1.6 relational systems and others 26 1.7 summary 28 exercises 29 references and bibliography 31 chapter 2 database system architecture 33 2.1 introduction 33 2.2 the three levels of the architecture 34 2.3 the external level 37 2.4 the conceptual level 39 2.5 the internal level 40 2.6 mappings 41 2.7 the database administrator 42 2.8 the database management system 44 .2.9 data communications 48 2.10 client／server architecture 49 2.11 utilities 51 2.1 2 distributed processing 5 1 2.13 summary 55 exercises 56 references and bibliography 56 chapter 3 an introduction to relational databases 59 3.1 introduction 59 3.2 an informal look at the relational model 60 3.3 relations and relvars 64 3.4 what relations mean 66 3.5 optimization 69 3.6 the catalog 71 3.7 base relvars and views 72 3.8 transactions 76 3.9 the suppliers-and-parts database 77 3.10 summary 79 exercises 81 references and bibliography 8 1 chapter 4 an introduction to sql 85 4.1 introduction 85 4.2 overview 86 4.3 the catalog 89 4.4 views 90 4.5 transactlons 91 4.6 embedded sql 91 4.7 dynamic sql and sql／cli 97 4.8 sql is not perfect 100 4.9 summary 101 exercises 102 references and bibliography 104 part ii the relational model 109 chapter 5 types 111 5.1 introduction 111 5.2 values vs.variables 112 5.3 types vs.representations 115 5.4 type definition 119 5.5 operators 122 5.6 type generators 127 5.7 sql facilities 128 5.8 summary 136 exercises 137 references and bibliography 139 chapter 6 relations 141 6.1 introduction 141 6.2 tuples 141 6.3 relation types 146 6.4 relation values 148 6.5 relation variables 156 6.6 sql facilities 161 6.7 summary 167 exercises 168 references and bibliography 170 chapter 7 relational algebra 173 7.1 introduction 173 7.2 closure revisited 175 7.3 the original algebra：syntax 177 7.4 the original algebra：semantics 180 7.5 examples 190 7.6 what is the algebra for? 192 7.7 further points 194 7.8 additional operators 195 7.9 grouping and ungrouping 203 7.10 summary 206 exercises 20 7 references and bibliography 209 chapter 8 relational calculus 213 8.1 introduction 213 8.2 tuple calculus 215 8.3 examples 223 8.4 calculus vs.algebra 225 8.5 computational capabilities 230 8.6 sql facilities 231 8.7 domain calculus 240 8.8 query-by-example 242 8.9 summary 247 exercises 248 references and bibliography 250 chapter 9 integrity 253 9.1 introduction 253 9.2 a closer look 255 9.3 predicates and propositions 258 9.4 relvar predicates and database predicates 259 9.5 checking the constraints 260 9.6 internal vs.external predicates 26 1 9.7 correctness vs.consistency 263 9.8 integrity and views 265 9.9 a constraint classification scheme 266 9.10 keys 268 9.1 1 triggers(a digression) 277 9.12 sql facilities 279 9.13 summary 284 exercises 285 references and bibliography 288 chapter 10 views 295 10.1 introduction 295 10.2 what are views for? 298 10.3 view retrievals 302 10.4 view updates 303 10.5 snapshots(a digression) 318 10.6 sql facilities 320 10.7 summary 323 exercises 324 references and bibliography 325 part iii database design 329 chapter 11 functional dependencies 333 11.1 introduction 333 11.2 basic definitions 334 11.3 trivial and nontrivial dependencies 337 11.4 closure of a set of dependencies 338 11.5 closure of a set of attributes 339 11.6 irreducible sets of dependencies 34 1 11.7 summary 343 exercises 344 references and bibliography 345 chapter 12 further normalization i: 1nf，2nf，3nf，bcnf 349 12.1 introduction 349 12.2 nonloss decomposition and functional dependencies 353 12.3 first，second，and third normal forms 357 12.4 dependency preservation 364 12.5 bovce／codd normal form 367 12.6 a note on relation-valued attributes 3 73 12.7 summary 375 exercises 3 76 references and bibliograph 378 chapter 13 further normalization li: higher normal forms 381 13.1 introduction 381 13.2 multi-valued dependencies and fourth normal form 382 13.3 join dependencies and fifth normal form 386 13.4 the normalization procedure summarized 39 1 13.5 a note on denormalization 393 13.6 orthogonal design(a digression) 395 13.7 other normal forms 398 13.8 summary 400 exercises 40 1 references and bibliography 402 chapter 14 semantic modeling 409 14.1 introduction 409 14.2 the overall approach 411 14.3 the e／r model 414 14.4 e／r diagrams 418 14.5 database design with the e／r model 420 14.6 a brief analysis 424 14.7 summary 428 exercises 429 references and bibliography 430 partiv transaction management 443 chapter 15 recovery 445 15.1 introduction 445 15.2 trantions 446 15.3 transaction recovery 450 15.4 system recovery 453 15.5 media recovery 455 15.6 two—phase commit 456 15.7 savepoints(a digression)457 15.8 sql facilities 458 15.9 summary 459 exercises 460 references and bibliography 460 chapter 16 concurrency 465 16.1 introduction 465 16.2 three concurrency problems 466 16.3 locking 470 16.4 the three concurrency problems revisited 472 16.5 deadlock 474 16.6 serializabilitv 476 16.7 recovery revisited 478 16.8 isolation levels 480 16.9 intent locking 483 16.10 dropping acid 485 16.11 sql facilities 490 16.12 summary 491 exercises 492 references and bibliography 494 partv further topics 501 chapter 17 security 503 17.1 introduction 503 17.2 discretionary access control 506 17.3 mandatory access control 511 17.4 statistical databases 5 13 17.5 data encryption 519 17.6 sql facilities 523 17.7 summary 527 exercises 528 reterences and bibliography 529 chapter 18 optimization 531 18.1 introduction 53 1 18.2 a motivating example 533 18.3 an overview of query processing 534 18.4 expressic transformation 539 18.5 database statistics 544 18.6 a divide-and-conquer strategy 545 18.7 implementing the relational operators 548 18.9 summary 553 exerclses 554 references and bibliography 557 chapter 19 missing information 575 19.1 introduction 575 19.2 an overview of the 3vl approach 577 19.3 some consequences of the foregoing scheme 582 19.4 nulls and keys 586 19.5 outer join(a digression) 589 19.6 special values 591 19.7 sql facilities 592 19.8 summary 597 exercises 598 references and bibliography 600 chapter 20 typ e inheritance 605 20.1 introduction 605 20.2 type hierarchies 6 10 20.3 polymorphism and substitutabilitv 6 13 20.4 variables and assignments 6 17 20.5 specialization by constraint 62 1 20.6 compansons 623 20.7 operators，versions，and signatures 626 20.8 is a circle an ellipse? 630 20.9 specialization by constraint revisited 634 20.10 sql facilities 636 20.11 summary 641 exercises 642 references and bibliography 644 chapter 21 distributed databases 647 2 1.1 introduction 647 2 1.2 some preliminaries 648 21.3 the twelve objectives 652 21.4 problems of distributed systems 660 21.5 client／server systems 671 2 1.6 dbms independence 674 21.7 sql facilities 679 21.8 summary 680 exercises 68 1 references and bibliography 682 chapter 22 decision support 689 22.1 introduction 689 22.2 aspects of decision support 69 1 22.3 database design for decision support 693 22.4 data preparation 70 1 22.5 data warehouses and data marts 704 22.6 online analytical processing 709 22.7 data mining 717 22.8 sql facilities 719 22.9 summary 720 exercises 721 references and bibliography 722 chapter 23 temporal databases 727 23.1 introduction 72 7 23.2 what is the problem? 732 23.3 intervals 73 7 23.4 packing and unpacking relations 743 23.5 generalizing the relational operators 754 23.6 database design 758 23.7 integrity constraints 764 23.8 summary 770 exercises 771 references and bibliography 772 chapter 24 logic-based databases 775 24.1 introduction 775 24.2 overview 776 24.3 propositional calculus 778 24.4 predicate calculus 783 24.5 a proof-theoretic view of databases 789 24.6 deductive database systems 793 24.7 recursive query processing 798 24.8 summary 803 exercises 806 references and bibliography 807 part vi objects，relations，and xml 811 chapter 25 object databases 813 25.1 introduction 813 25 12 objects，classes，methods，and messages 817 25.3 a closer look 822 25.4 a cradle-to-grave example 830 25.5 miscellaneous issues 840 25.6 summary 847 exercises 850 references and bibliography 85 1 chapter 26 object／relational databases 859 26.1 introduction 859 26.2 the first great blunder 862 26.3 the second great blunder 870 26.4 implementation issues 8 74 26.5 benefits of true rapprochement 876 26.7 sql facilities 8 78 summary 885 exercises 885 references and bibliography 886 chapter 27 the world wide web and xml 895 27.1 introduction 895 27.2 the web and the internet 896 27.3 an overview of xml 897 27.4 xml data definition 908 27.5 xml data manipulation 9 17 27.6 xml and databases 925 27.7 sql facilities 928 27.8 summary 932 exercises 934 references and bibliography 935 appendixes 939 appendix a the transrelationaltm model 941 a.1 introduction 94 1 a.2 three levels of abstraction 943 a.3 the basic idea 946 a.4 condensed columns 952 a.5 merred columns 956 a.6 implementing the relational operators 960 a.7 summary 966 references and bibliography 966 appendix b sql expressions 967 b.1 introduction 967 b.2 table expressions 968 b.3 boolean expressions 973 appendix c abbreviations ， acronyms l and symbols 977 |
内容加载中，请稍后...
商品评论（0条）