deHaan / Koppelaars Applied Mathematics for Database Professionals

1. ed
ISBN: 978-1-4302-0348-3
Verlag: Apress
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 379 Seiten

This book touches on an area seldom explored: the mathematical underpinnings of the relational database. The topic is important, but far too often ignored. This is the first book to explain the underlying math in a way that's accessible to database professionals. Just as importantly, if not more so, this book goes beyond the abstract by showing readers how to apply that math in ways that will make them more productive in their jobs. What's in this book will 'open the eyes' of most readers to the great power, elegance, and simplicity inherent in relational database technology.

Lex de Haan studied applied mathematics at the University of Technology in Delft, the Netherlands. His experience with Oracle goes back to the mid-1980s, version 4. He worked for Oracle Corporation from 1990 to 2004 in various education-related roles, ending up in Server Technologies (product development) as senior curriculum manager for the advanced database administration curriculum. In that role, he was involved in the development of Oracle9i and Oracle Database 10g. In March 2004, he decided to go independent and founded Natural Join B.V. (http://www.naturaljoin.nl). From 1999 until his passing in 2006, he was involved in the ISO SQL language standardization process, as a member of the Dutch national body. He was also one of the founding members of the OakTable network (http://www.oaktable.net).

Autoren/Hrsg.

deHaan, Lex

Koppelaars, Toon

Inhaltsverzeichnis

1;Contents at a Glance;5
2;Contents;7
3;Foreword;15
4;About the Authors;17
5;About the Technical Reviewers;18
6;Acknowledgments;19
7;Preface;20
8;Introduction;21
8.1;Mathematicians;21
8.2;High- Level Book Overview;22
8.3;Database Design Implementation Issues;23
9;The Mathematics;25
9.1;Logic: Introduction;26
9.1.1;The History of Logic;27
9.1.2;Values, Variables, and Types;28
9.1.3;Propositions and Predicates;28
9.1.4;Logical Connectives;31
9.1.5;Truth Tables;34
9.1.6;Functional Completeness;39
9.1.7;Special Predicate Categories;40
9.1.8;Logical Equivalences and Rewrite Rules;41
9.1.9;Chapter Summary;44
9.1.10;Exercises;45
9.2;Set Theory: Introduction;46
9.2.1;Sets and Elements;47
9.2.2;Methods to Specify Sets;49
9.2.3;Venn Diagrams;51
9.2.4;Cardinality and Singleton Sets;52
9.2.5;Subsets;53
9.2.6;Union, Intersection, and Difference;54
9.2.7;Powersets and Partitions;58
9.2.8;Ordered Pairs and Cartesian Product;61
9.2.9;Sum Operator;63
9.2.10;Some Convenient Shorthand Set Notations;64
9.2.11;Chapter Summary;64
9.2.12;Exercises;65
9.3;Some More Logic;69
9.3.1;Algebraic Properties;69
9.3.2;Quantifiers;73
9.3.3;Normal Forms;81
9.3.4;Chapter Summary;85
9.3.5;Exercises;86
9.4;Relations and Functions;88
9.4.1;Binary Relations;89
9.4.2;Functions;91
9.4.3;Operations on Functions;96
9.4.4;Set Functions;98
9.4.5;Function Composition;103
9.4.6;Chapter Summary;105
9.4.7;Exercises;106
10;The Application;109
10.1;Tables and Database States;111
10.1.1;Terminology;111
10.1.2;Tables;114
10.1.3;Database States;118
10.1.4;Operations on Tables;121
10.1.5;Chapter Summary;133
10.1.6;Exercises;134
10.2;Tuple, Table, and Database Predicates;136
10.2.1;Tuple Predicates;137
10.2.2;Table Predicates;139
10.2.3;Database Predicates;143
10.2.4;A Few Remarks on Data Integrity Predicates;146
10.2.5;Common Patterns of Table and Database Predicates;146
10.2.6;Chapter Summary;156
10.2.7;Exercises;157
10.3;Specifying Database Designs;158
10.3.1;Documenting Databases and Constraints;159
10.3.2;The Layers Inside a Database Design;160
10.3.3;Specifying the Example Database Design;162
10.3.4;Chapter Summary;201
10.3.5;Exercises;202
10.4;Specifying State Transition Constraints;204
10.4.1;More Data Integrity Predicates;204
10.4.2;State Transition Constraints;209
10.4.3;Chapter Summary;215
10.4.4;Exercises;216
10.5;Data Retrieval;217
10.5.1;Formally Specifying Queries;217
10.5.2;Example Queries Over DB_ UEX;219
10.5.3;A Remark on Negations;234
10.5.4;Chapter Summary;236
10.5.5;Exercises;237
10.6;Data Manipulation;239
10.6.1;Formally Specifying Transactions;239
10.6.2;Example Transactions Over DB_ UEX;244
10.6.3;Chapter Summary;254
10.6.4;Exercises;254
11;The Implementation;256
11.1;Implementing Database Designs in Oracle;257
11.1.1;Introduction;258
11.1.2;Window- on- Data Applications;259
11.1.3;Implementing Data Integrity Code;263
11.1.4;Implementing Table Structures;271
11.1.5;Implementing Attribute Constraints;275
11.1.6;Implementing Tuple Constraints;278
11.1.7;Table Constraint Implementation Issues;281
11.1.8;Implementing Table Constraints;306
11.1.9;Implementing Database Constraints;307
11.1.10;Implementing Transition Constraints;312
11.1.11;Bringing Deferred Checking into the Picture;315
11.1.12;The RuleGen Framework;319
11.1.13;Chapter Summary;320
11.2;Summary and Conclusions;321
11.2.1;Summary;321
11.2.2;Conclusions;322
12;Appendixes;325
12.1;Formal Definition of Example Database;326
12.1.1;Bird’s Eye Overview;327
12.1.2;Database Skeleton DB_ S;328
12.1.3;Table Universe Definitions;329
12.1.4;Database Characterization DBCH;339
12.1.5;Database Universe DB_ UEX;340
12.1.6;State Transition Universe TX_ UEX;345
12.2;Symbols;347
12.3;Bibliography;349
12.4;Nulls and Three (or More) Valued Logic;351
12.4.1;To Be Applicable or Not;351
12.4.2;Three ( or More) Valued Logic;354
12.5;Answers to Selected Exercises;361
12.5.1;Chapter 1 Answers;361
12.5.2;Chapter 2 Answers;366
12.5.3;Chapter 3 Answers;367
12.5.4;Chapter 4 Answers;369
12.5.5;Chapter 5 Answers;370
12.5.6;Chapter 6 Answers;371
12.5.7;Chapter 7 Answers;372
12.5.8;Chapter 8 Answers;374
12.5.9;Chapter 9 Answers;375
12.5.10;Chapter 10 Answers;378
12.6;Index;380