E.

F Codd's Rules
In 1985 E. F. Codd presented a set of 13 rules as a basis of determining whether a DBMS could be classified as Relational. The relational theory to its full potential. These Rules can be divided into 5 functional areas:

1. 2. 3. 4. 5.

Foundation Rules Structural Rules Integrity Rules Data Manipulation Rules Data Independence Rules

1. Foundation Rules (Rule Zero & 12)

Rule Zero (0):
RDBMS must manage every aspect within itself. Without using an external language. Processing should not be done with external storage. Definition: Each RDBMS has it own file system not use the operating system file. Oracle has its own file system. Explanation: It initializes in memory at the time of start up & storage is also in oracle file system & cant access by explorer (windows explorer). It cant take any type of help with other file system.

Rule 12 Non-subversion Rule:

In case of help rendered by some other languages rules governing RDBMS should not be implemented.

Definition: This does not prohibit use of record at a time languages e.g. PL/SQL. All database
access must be controlled through the DBMS so that the integrity of the database cannot be compromised without the knowledge of the user or the DBA.

2. Structural Rules (Rules 1 & 6)

The fundamental structural construct is the table. Codd states that an RDBMS must support tables, domains, primary & foreign keys. Each table should have a primary key.
n n

Rule 1) Information Rule: Information can be represented in one and only way
that is TABLES.

Definition: RDBMS store its information in the form of table even the data about data is
also store in table form. All information in an RDBMS is represented logically in just one way - by values in tables.

All Information (inlcuding metadata) is to be represented as data stored in cells of tables. The rows and columns have to be strictly unordered.

Rule 6) View Updating:

Each distinct row of a view must correspond to a distinct and uniquely identifiable row of the base table.

Definition: DBA gives the right to access any table. DBA design a view in which user
access only those records in which BDA gives the rights. if we changing in view already effect in table. If we changing in table take already in view. User rights gives by DBA. Any view that is theoretically updatable must be updatable through the system. Example: If a view is formed as join of 3 tables, changes to view should be reflected in base tables

3. Integrity Rules (Rules 3 & 10)

Integrity should be maintained by the DBMS not the application.

Rule 3 - Systematic treatment of null: RDBMS should be able to operate with

null value. Operations with null should be performing by a single command.

Definition: Null means nothing. Oracle has the facility to handle the null value. If we
assign any field not null we must enter the record in this key like the primary key of record. We can insert the 0 value easily on that place where the value is null Nulls must be represented and treated in a systematic way, independent of data type. Null values are supported for representation of 'missing' & inapplicable information in a systematic way & independent of data type.

Rule 10) Integrity independence:

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. The database should be able to enforce its own integrity rather than using other programs All relation integrity constraints must be definable in the relational language and stored in the system catalog, not at application level. This gives the advantage of centralized control & enforcement

4. Data Manipulation Rules (Rule 2, 4, 5 & 7)

User should be able to manipulate the 'Logical View' of the data with no need for knowledge of how it is Physically stored or accessed.

Rule 2) Guaranteed Access: Access to tables follow the sequence of table name,
tupuole, attributes. Every step of data guarantee has been identified access to your work area involves qualifying the user name and passwords.

Definition: Oracle has the account of user and its password. Without it user cant
access it. It can create by a DBA against the request of user. 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. Each unique piece of data (atomic value) should be accesible by : TableName + Primary Key (Row) + Attribute (Column)

Rule 4) Dynamic on-line Catalog: The RDBMS should maintain data dictionary
tables (catalog).

Definition: All the data in any table but that information is in summary form present in
catalog access by DBA. The another name of catalog is active online catalog. Catalog is the main characteristics of RDBMS. Catalog has the data about data called META DATA. Like fat on disk have the data about data on disk.

The metadata must be stored and managed as ordinary data, that is, in tables within the database. Such data must be available to authorized users using the standard database relational language. System & other data stored & manipulated in the same way.

Rule 5) Comprehensive Data Sublanguage: (DSL)

transactional. (DDL) Data definition language. (DML) Data manipulation language (DCL) Data control language)

RDBMS should have

Definition: 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). One well defined language to provide all manners of access to data Example: SQL The relational database may support many

Rule 7) High-level insert, update & Delete: By single command insertions,

deletions and replacements should be possible.

Definition: In oracle insertion, Deletion, updating must be held on one command.

Means one command for insertion, one for deletion and one for updating. 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.

There must be insert, update, delete operations at the level of Relations Set operations like Union,Intersection and Minus should be supported The database must support set-level inserts, updates, and deletes.

5. Data Independence Rules (Rules 8, 9, 11)

These rules protect users & application developers from having to change the applications following any low-level reorganisation of the DB.

Rule 8) Physical Data Independence: Recording on the data base should be

left to the desecration of the type of system used.

Definition: In oracle if we store any application there is no effect on operating system.

Application programs and terminal activities remain logically unimpaired whenever any changes are made in either storage representations or access methods. The physical storage of data should not matter to the system Application programs and ad hoc facilities are logically unaffected when physical access methods or storage structures are changed.

Rule 9) Logical Data Independence: Should not be recompiled. Programming

efforts should not be wasted as to change logic. Depending on the storage style

Definition: In oracle the compilation result store in the buffer. If the other user write the
some command than compiler give the result of if which they already store in the buffer. But there is a limited data store in the buffer. 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. Application programs and ad hoc facilities are logically unaffected when changes are made to the table structures that preserve the original table values.

Rule 11) Distribution Independence: Should look like a centralized system to

the user.

Definition: According to this rule user cant see the complexity of back end
environment. They work on simple front-end environment. An RDBMS has distribution independence. Distribution independence implies that users should not have to be aware of whether a database is distributed. A database should work properly regardless of its distribution across a network.