PAPERS



Order papers targeted at the data professional/user who thinks critically and independently and appreciates a scientific approach, rather than follows the IT industry's fad-driven "cookbook mode". They offer accessible explanations the true relational technology—what we believe it would have been had  E.F. Codd completed his work—and the practical implications thereof. The papers outline McGoveran's re-interpretation of Codd's work that is consistent with the theoretical foundation of RDM and is distinct from the version that emerged in the industry after Codd's passing. 

Scroll down to order (DO NOT ORDER FROM AMAZON - THOSE PAPERS ARE OBSOLETE!!!!!)

 

PRACTICAL DATABASE FOUNDATIONS ($35/paper)

 This series:

  • Dispels common, misuse and abuse of data and relational fundamentals;
  • Clarifies fundamental terminology, concepts and features of the real RDM that are ignored, distorted and misunderstood in the industry;
  • Conveys the practical advantages of  RDM of which practitioners are unaware and/or which the industry has failed to deliver.

 


Table of Contents

Introduction
1 Formal Theory and Interpretation
2 Database Domains
2.1 Domains As Data Types
2.1.1 RDM and Programming Data Types
2.1.2 Abstract Data Types
2.2 Domain Definition
2.2.1 Type Specification
2.2.2 Domain Operators
3 Kinds of Domains
3.1 Base and Derived Domains
3.2 Primitive Domains
3.3 Atomic ("Simple") Domains
3.4 Complex (Derived) Domains
4 RDM Type System
5 DBMS Domain Support
Appendix 1: A Complex Domain Example
Appendix 2: A Note on SQL Built-in Data Types








Table of Contents

Introduction

1 Conceptual Modeling

1.1 Ontological Commitment

1.2 Relationships as Properties

2 Object-properties Modeling

2.1 Entity Properties 

2.1.1 1st Order Properties

2.1.1.1 Names

2.1.2 2nd Order Properties

2.2 3rd  Order Group Properties

2.2.1 Uniqueness 3OPs

2.2.2 Bounded Aggregate 3OPs

2.2.3 Meaning Criteria

2.3 4th Order Multigroup Properties

2.3.1 Referential 4OPs

2.3.2 Aggregates 4OPs

3 Business Rules

3.1 Property Rules

3.1.1 1OP Rules

3.1.2. 1OPiC Rules

3.2 Object Type Rules

3.2.1 Entity Type Rules

3.2.1.1 1OPiCs-Entity Rules

3.2.1.2 2OP Rules

3.2.2 Group Type Rules

3.2.2.1 Uniqueness 3OP Rules

3.2.2.2 Aggregates 3OP Rules

3.2.3 Multigroup Type Rules

3.2.3.1 Referential 4OP Rules

3.2.3.2 Aggregates 4OP Rules

Conclusion

Appendix A: Quasi-Properties



 
 
Table of Contents

Introduction
1. Interpretation of Database Relations
1.1. Attributes as Constrained Domains
1.2. Time-Varying Relations
2. Representation of Database Relations
2.1. Physical Data Independence
2.1.1. Uniquely Named Attributes
2.1.2. Primary Keys
2.1.3. Relations and R-tables
3. Normalization
3.1. First Normal Form and “Simple” Domains
3.2. Normalization and Nonsimple Domains
3.2.1. Foreign Keys
Conclusion

 

 

  Table of Contents

Introduction
1. Logical Symmetric Access
2. Universal Data Sublanguage
2.1. FOPL vs. SOL
2.2. Relational Completeness
2.3. Computational Completeness and Hosting
3. Kinds of Relations
3.1. Expressible and Named Relations
3.2. Derived Relations
3.3. Data Storage
4. Derived Relations and Redundancy
4.1. Database Consistency
5. Database Catalog
Conclusion

 

Table of Contents
 
Introduction
1. The Normal Form
2. First Normal Form
2.1. FOPL vs. SOL
3. Domain Decomposability and Value Atomicity
4. 1NF and Tables
5. SQL and 1NF
5.1. Repeating Groups and Repeated Attributes
5.2. Information Principle and SQL

 
 
Table of Contents

Introduction
1. Entities, Properties, Names, and Identifiability
2. Relational Representation
3. Relational Keys
4. Kinds of Key
4.1. Candidate, Primary and Alternate Keys
4.2. Natural and Surrogate Keys
5. Formal Primary Key Mandate
6.Primary Key Selection
7. Key Constraints
8. Primary Keys and Performance
8.1. Indexes
Conclusion
Appendix: Duplicates (and SQL)
1. SQL and PKs
2. Duplicates
2.1. Interpretation
2.2. Result Correctness
2.3. Query Nestability
2.4. Language Redundancy
2.5. Performance Optimization
2.6. Performance Optimization


Table of Contents

Introduction
1. “Inapplicable Data”: Nothing's Missing
2. Missing Data: Into the Unknown
3. SQL NULL: What-Valued Logic?
4. Known Unknowns: Metadata
5. A Relational Solution
5.1. The Practicality of Theory
5.2. A Real World Example
5.3. Relation Proliferation
6. Questions/Comments/Objections
Conclusion


How to order

  1. Preferred personal check, money order, or cashier check (US); international money order, cashier check, Western Union (non-US)--gets 5% discount. Email me with wanted papers for mailing address.

  2. If that is absolutely impossible,  EMAIL ME BEFORE YOU DONATE via PayPal.


Revisions and new editions:

  • Same year revisions free.

  • Later revisions half price.

  • New editions (full rewrites) full price.

 

 

Last updated  02/19/26



1 comment:

View My Stats