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.

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

Table of Contents

Introduction
1 Information Representation
2 Conceptual Modeling
2.1 Ontological Commitment
2. 2 Properties and Relationships
3. Entity Properties  
3.1 First Order Properties
3.2 Assertion Predicates
3.3 Second Order Properties
4 Group Properties
4.1 Third Order Properties
4.1.1 Entity Uniqueness
4.1.2 1OP (in Context) Dependencies
4.1.3 Aggregates Relationships
4.1.4 Meaning Criteria and ESS Relationships
4.1.5 Designation “Property”
5 Multigroup Fourth Order Properties
5.1 Inter-group Entity Relationships
5.2 Inter-group Aggregates Relationships
6. Business Rules
6.1 Entity Type Rules
6.2 Group Type Rules
6.3 Multigroup Type Rules
Conclusion
Appendix: PoM/OCP and RDM

 

 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. 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

IN PROGRESS

FORTHCOMING

How to order

1. Check or Money Order is preferred (email me with wanted papers for mailing address) and gets 5% discount.
   

2. If that is not possible, use the site's DONATE Paypal page and email me the titles you want.
   

   
   

Revisions and new editions:

• Same year revisions free.

• Later revisions half price
  

• New editions (full rewrites) full price.

Last updated  1/16/25