internet.com
You are in the: Small Business Computing Channelarrow View Sites +
Small Business Technology
» ECommerce-Guide | Small Business Computing | Webopedia | WinPlanet |  »Close
Webopedia.com
Enter a word for a definition... ...or choose a computer category.
 
 

menu
   Home
   Term of the Day
   New Terms
   Pronunciation
   New Links
   Quick Reference
   Did You Know?
   Categories
   Tech Support
   Webopedia Jobs
   About Us
   Link to Us
   Advertising
  

talk to us
   Submit a URL
   Suggest a Term
   Report an Error

internet.com
Developer
International
Internet Lists
Internet News
Internet Resources
IT
Linux/Open Source
Personal Technology
Small Business
Windows Technology
xSP Resources
Search internet.com
Advertise
Corporate Info
Newsletters
Tech Jobs
E-mail Offers
commerce
  Be a Commerce Partner
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Codd’s Rules
Last modified: Wednesday, September 25, 2002 

Also called Codd's Law, a set of 13 rules used to determine if a DBMS can be considered a relational DBMS (RDBMS). In 1985, Dr. E. F. Codd first published this list of rules that became a standard way of evaluating a relational system. The rules have since been expanded by others, and after publishing the original article Codd stated that there are no systems that will satisfy every rule. Following are Codd’s original 13 rules:

  • Often referred to as rule 0, this rule states that all subsequent rules are based on the notion that in order for a database to be considered relational, it must use its relational facilities exclusively to manage the database.
  • 1. The Information rule: All information in an RDBMS is represented logically in just one way - by values in tables.
  • 2. The Guaranteed Access rule: Each item of data in an RDBMS is guaranteed to be logically accessible by resorting to a combination of table name, primary key value, and column name.
  • 3. The Systematic Treatment of Null Values rule: Null values (distinct from an empty character string or a string of blank characters and distinct from zero or any other number) are supported in a fully relational DBMS for representing missing information and inapplicable information in a systematic way, independent of the data type.
  • 4. The Dynamic Online Catalog Based on the Relational Model rule: The database description is represented at the logical level in the same way as ordinary data, so that authorized users can apply the same relational language to its interrogation as they apply to the regular data.
  • 5. The Comprehensive Data Sublanguage rule: A relational system may support several languages and various modes of terminal use (for example, the fill-in-blanks mode). However, there must be at least one language whose statements are expressible, per some well-defined syntax, as character strings and whose ability to support all of the following is comprehensible: data definition, view definition, data manipulation (interactive and by program), integrity constraints, and transaction boundaries (begin, commit, and rollback).
  • 6. The View Updating rule: All views of the data which are theoretically updatable must be updatable in practice by the DBMS.
  • 7. The High-level Insert, Update, and Delete rule: The capability of handling a base relation or a derived relation as a single operand applies not only to the retrieval of data but also to the insertion, update, and deletion of data.
  • 8. The Physical Data Independence rule: Application programs and terminal activities remain logically unimpaired whenever any changes are made in either storage representations or access methods.
  • 9. The Logical Data Independence rule: Application programs and terminal activities remain logically unimpaired when information preserving changes of any kind that theoretically permit unimpairment are made to the base tables.
  • 10. The Integrity Independence rule: Integrity constraints must be definable in the RDBMS sub-language and stored in the system catalogue and not within individual application programs.
  • 11. The Distribution Independence rule: An RDBMS has distribution independence. Distribution independence implies that users should not have to be aware of whether a database is distributed.
  • 12. The Nonsubversion rule: If the database has any means of handling a single record at a time, that low-level language must not be able to subvert or avoid the integrity rules which are expressed in a higher-level language that handles multiple records at a time.

E-mail this definition to a colleague


For internet.com pages about Codd’s Rules . Also check out the following links!

Related Links

Database Journal 
An excellent resource for database professionals.

Introduction to Relational Databases - Part 1: Theoretical Foundation 
The first article in this two-part series provides a basic understanding of the theoretical principles of database design and describes some key elements and rules of creating relational databases.

related categories

Data Management

Databases

related terms

database

database management system

RDBMS


webopedia
Give Us Your
Feedback




JupiterWeb networks:

internet.comearthweb.comDevx.com graphics.com

Search JupiterWeb:

Jupitermedia Corporation has two divisions:
Jupiterimages andJupiterWeb


Legal Notices, Licensing, Reprints, & Permissions, Privacy Policy.

Jupitermedia Corporate Info | Newsletters | Tech Jobs | Shopping | E-mail Offers