DATABASES，TYPES，AND THE RELATIONAL MODEL （THIRD EDITION）PDF|Epub|txt|kindle电子书版本网盘下载

DATABASES，TYPES，AND THE RELATIONAL MODEL （THIRD EDITION）PDF格式电子书版下载

注意：本站所有压缩包均有解压码： 点击下载压缩包解压工具

PART Ⅰ PRELIMINARIES1

Chapter 1 Background and Overview3

The Third Manifesto4

Back to the relational future8

Some guiding principles10

Some crucial logical differences11

Concluding remarks13

Exercises14

Chapter 2 A Survey of the Relational Model17

The running example17

Tuples19

Relations21

Relation variables24

Relvars, relations, and predicates28

Integrity constraints32

Relational operators34

Virtual relvars46

The relational model47

Exercises48

Chapter 3 Toward a Theory of Types55

Values are typed57

Types vs. representations60

Scalar vs. nonscalar types60

Possible representations61

Selectors and THE_ operators62

System-defined types68

Operators69

Type generators73

Concluding remarks75

Exercises75

PART Ⅱ FORMAL SPECIFICATIONS79

Chapter 4 The Third Manifesto81

RM Prescriptions81

RM Proscriptions88

OO Prescriptions88

OO Proscriptions89

RM Very Strong Suggestions89

OO Very Strong Suggestions90

Recent Manifesto changes90

Chapter 5 Tutorial D93

Common constructs96

Scalar definitions98

Tuple definitions100

Relational definitions101

Scalar operations102

Tuple operations105

Relational operations110

Relations and arrays117

Statements118

Recent language changes120

A remark on syntax122

Exercises123

PART Ⅲ INFORMAL DISCUSSIONS AND EXPLANATIONS127

Chapter 6 RM Prescriptions129

RM Prescription1: Scalar types129

RM Prescription 2: Scalar values are typed132

RM Prescription 3: Read-only vs. update operators133

RM Prescription 4: Physical vs. possible representations139

RM Prescription 5: Expose possible representations144

RM Prescription 6: Type generator TUPLE147

RM Prescription 7: Type generator RELATION152

RM Prescription 8: Equality155

RM Prescription 9: Tuples157

RM Prescription 10: Relations158

RM Prescription 11: Scalar variables159

RM Prescription 12: Tuple variables160

RM Prescription 13: Relation variables (relvars)161

RM Prescription 14: Kinds of relvars162

RM Prescription 15: Candidate keys165

RM Prescription 16: Databases166

RM Prescription 17: Transactions167

RM Prescription 18: Relational algebra167

RM Prescription 19: Relvar names, relation selectors, and recursion172

RM Prescription 20: User-defined tuple and relational operators176

RM Prescription 21: Assignments177

RM Prescription 22: Comparisons180

RM Prescription 23: Integrity constraints181

RM Prescription 24: Total database constraints186

RM Prescription 25: Catalog187

RM Prescription 26: Language design187

Exercises188

Chapter 7 RM Proscriptions191

RM Proscription 1: No attribute ordering191

RM Proscription 2: No tuple ordering193

RM Proscription 3: No duplicate tuples193

RM Proscription 4: No nulls193

RM Proscription 5: No nullological mistakes194

RM Proscription 6: No internal-level constructs194

RM Proscription 7: No tuple-level operations195

RM Proscription 8: No composite attributes196

RM Proscription 9: No domain check override196

RM Proscription 10: Not SQL196

Exercises197

Chapter 8 OO Prescriptions199

OO Prescription 1: Compile-time type checking199

OO Prescription 2: Type inheritance (conditional)199

OO Prescription 3: Computational completeness200

OO Prescription 4: Explicit transaction boundaries201

OO Prescription 5: Nested transactions202

OO Prescription 6: Aggregate operators and empty sets203

Exercises204

Chapter 9 OO Proscriptions205

OO Proscription1: Relvars are not domains205

OO Proscription 2: No object IDs209

Exercises212

Chapter 10 RM Very Strong Suggestions215

RM Very Strong Suggestion 1: System keys215

RM Very Strong Suggestion 2: Foreign keys218

RM Very Strong Suggestion 3: Candidate key inference219

RM Very Strong Suggestion 4: Transition constraints220

RM Very Strong Suggestion 5: Quota queries221

RM Very Strong Suggestion 6: Generalized transitive closure223

RM Very Strong Suggestion 7: User-defined generic operators226

RM Very Strong Suggestion 8: SQL migration227

Exercises238

Chapter 11 OO Very Strong Suggestions241

OO Very Strong Suggestion 1: Type inheritance241

OO Very Strong Suggestion 2: Types and operators unbundled241

OO Very Strong Suggestion 3: Single-level store242

Exercises243

PART Ⅳ SUBTYPEING AND INHERITANCE245

Chapter 12 Preliminaries247

Toward a type inheritance model248

Single vs. multiple inheritance249

Scalars, tuples, and relations249

The running example250

Concluding remarks258

Exercises259

Chapter 13 The Inheritance Model261

IM Prescriptions261

Recent inheritance model changes267

Chapter 14 Single Inheritance with Scalar Types269

IM Prescription 1: Types are sets269

IM Prescription 2: Subtypes are subsets269

IM Prescription 3: "Subtype of" is reflexive271

IM Prescription 4: Proper subtypes272

IM Prescription 5: "Subtype of" is transitive272

IM Prescription 6: Immediate subtypes272

IM Prescription 7: Root types disjoint273

IM Prescription 8: Scalar values with inheritance273

IM Prescription 9: Scalar variables with inheritance274

IM Prescription 10: Specialization by constraint279

IM Prescription 11: Assignment with inheritance282

IM Prescription 12: Equality etc. with inheritance285

IM Prescription 13: Join etc. with inheritance286

IM Prescription 14: TREAT288

IM Prescription 15: Type testing292

IM Prescription 16: Read-only operator inheritance and value substitutability295

IM Prescription 17: Operator signatures298

IM Prescription 18: Read-only parameters to update operators305

IM Prescription 19: Update operator inheritance and variable substitutability305

IM Prescription 20: Union, dummy, and maximal and minimal types309

Exercises315

Chapter 15 Multiple Inheritance with Scalar Types317

An introductory example317

Type graphs323

Least specific types unique325

Most specific types unique326

Remarks on operator inheritance333

Exercises334

Chapter 16 Inheritance with Tuple and Relation Types337

IM Prescription 21: Tuple/relation subtypes and supertypes337

IM Prescription 22: Tuple/relation values with inheritance341

IM Prescription 23: Maximal and minimal tuple/relation types343

IM Prescription 24: Tuple/relation most specific types346

IM Prescription 25: Tuple/relation variables with inheritance351

Some implications of IM Prescriptions 21-25353

Exercises357

APPENDIXES359

Appendix A A New Relational Algebra361

Motivation and justification361

REMOVE, RENAME, and COMPOSE364

Treating operators as relations366

Formal definitions369

How Tutorial D builds on A371

Appendix B A Design Dilemma?377

Encapsulation377

Discussion378

Further considerations379

Appendix C Types and Units381

Type definition381

Selectors382

THE operators383

Computational operators384

Display operators385

Type constraints386

A more complex example386

Appendix D What Is a Database?389

Updating the database389

Databases vs. tuples390

Appendix E View Updating393

Date's appoach393

Assumptions and notation394

A closer look at relational assignment395

A model of updating398

A closer look at constraints399

Updating restrictions403

Updating intersections405

Updating unions408

Updating differences410

Nested updates412

Updating extensions417

Updating joins418

Updating projections424

Some remarks on orthogonality428

A remark on multiple assignment430

Summary431

Darwen's approach432

Appendix F A Closer Look at Specialization by Constraint443

The 3 out of 4 "rule"443

What does inheritance really mean?448

Benefits of S by C449

What about objects?452

Implementation considerations455

Appendix G A Closer Look at Structural Inheritance461

An introductory example461

Tuple types, values, and variables463

Subtables and supertables467

Scalar types revisited471

Structural inheritance with fewer tears472

Appendix H A Comparison with SQL479

RM Prescriptions480

RM Proscriptions490

OO Prescriptions491

OO Proscriptions492

RM Very Strong Suggestions493

OO Very Strong Suggestions493

IM Prescriptions494

Appendix I A Grammar for Tutorial D499

Appendix J References and Bibliography513

Index545