- DBMS Tutorial
- DBMS - Home
- DBMS - Overview
- DBMS - Architecture
- DBMS - Data Models
- DBMS - Data Schemas
- DBMS - Data Independence
- Entity Relationship Model
- DBMS - ER Model Basic Concepts
- DBMS - ER Diagram Representation
- DBMS - Generalization, Aggregation
- Relational Model
- DBMS - Codd's Rules
- DBMS - Relational Data Model
- DBMS - Relational Algebra
- DBMS - ER to Relational Model
- DBMS- SQL Overview
- Relational Database Design
- DBMS - Database Normalization
- DBMS - Database Joins
- Storage and File Structure
- DBMS - Storage System
- DBMS - File Structure
- Indexing and Hashing
- DBMS - Indexing
- DBMS - Hashing
- Transaction And Concurrency
- DBMS - Transaction
- DBMS - Concurrency Control
- DBMS - Deadlock
- Backup and Recovery
- DBMS - Data Backup
- DBMS - Data Recovery
- DBMS Useful Resources
- DBMS - Quick Guide
- DBMS - Useful Resources
- DBMS - Discussion
E.F. Codd’s 12 Rules for RDBMS
Database Management System or DBMS essentially consists of a comprehensive set of application programs that can be leveraged to access, manage and update the data, provided the data is interrelated and profoundly persistent. Just like any management system, the goal of a DBMS is to provide an efficient and convenient environment in which it becomes easy to retrieve and store the information into the database. It goes without mentioning that databases are used to store and manage large amounts of information.
To achieve this, the following are the absolute must-haves:
- Data Modeling − It is all about defining the structures for information storage.
- Provision of Mechanisms − To manipulate processed data and modify file and system structures, it is important to provide query processing mechanisms.
- Crash Recovery and Security − To avoid any discrepancies and ensure that the data is secure, crash recovery and security mechanisms are must.
- Concurrency Control − If the system is shared by multiple users, concurrency control is the need of the hour.
Dr Edgar F Codd
Dr E.F.Codd, also known to the world as the ‘Father of Database Management Systems’ had propounded 12 rules which are in-fact 13 in number. The rules are numbered from zero to twelve. According to him, a DBMS is fully relational if it abides by all his twelve rules. Till now, only few databases abide by all the eleven rules. His twelve rules are fondly called ‘E.F.Codd’s Twelve Commandments’. His brilliant and seminal research paper ‘A Relational Model of Data for Large Shared Data Banks’ in its entirety is a visual treat to eyes.
Relational Database Management System
There is an unspoken rule in the jargon of Database Management Systems. As the databases that implement all the E.F.Codd’s rules are scare, the unspoken rule has been gaining traction.
- If a management system or software follows any of 5-6 rules proposed by E.F.Codd, it qualifies to be a Database Management System (DBMS).
- If a management system or software follows any of 7-9 rules proposed by E.F.Codd, it qualifies to be a semi-Relational Database Management System (semi- RDBMS).
- If a management system or software follows 9-12 rules proposed by E.F. Codd, it qualifies to be a complete Relational Database Management System (RDBMS).
Dr Edgar F Codd’s Twelve Commandments
Here is brief note on E.F Codd’s Twelve rules:
Rule 0 − Foundation rule
Any relational database management system that is propounded to be RDBMS or advocated to be a RDBMS should be able to manage the stored data in its entirety through its relational capabilities.
Rule 1 − Rule of Information
Relational Databases should store the data in the form of relations. Tables are relations in Relational Database Management Systems. Be it any user defined data or meta-data, it is important to store the value as an entity in the table cells.
Rule 2 − Rule of Guaranteed Access
The use of pointers to access data logically is strictly forbidden. Every data entity which is atomic in nature should be accessed logically by using a right combination of the name of table, primary key represented by a specific row value and column name represented by attribute value.
Rule 3 − Rule of Systematic Null Value Support
Null values are completely supported in relational databases. They should be uniformly considered as ‘missing information’. Null values are independent of any data type. They should not be mistaken for blanks or zeroes or empty strings. Null values can also be interpreted as ‘inapplicable data’ or ‘unknown information.’
Rule 4 − Rule of Active and online relational Catalog
In the Database Management Systems lexicon, ‘metadata’ is the data about the database or the data about the data. The active online catalog that stores the metadata is called ‘Data dictionary’. The so called data dictionary is accessible only by authored users who have the required privileges and the query languages used for accessing the database should be used for accessing the data of data dictionary.
Rule 5 − Rule of Comprehensive Data Sub-language
A single robust language should be able to define integrity constraints, views, data manipulations, transactions and authorizations. If the database allows access to the aforementioned ones, it is violating this rule.
Rule 6 − Rule of Updating Views
Views should reflect the updates of their respective base tables and vice versa. A view is a logical table which shows restricted data. Views generally make the data readable but not modifiable. Views help in data abstraction.
Rule 7 − Rule of Set level insertion, update and deletion
A single operation should be sufficient to retrieve, insert, update and delete the data.
Rule 8 − Rule of Physical Data Independence
Batch and end user operations are logically separated from physical storage and respective access methods.
Rule 9 − Rule of Logical Data Independence
Batch and end users can change the database schema without having to recreate it or recreate the applications built upon it.
Rule 10 − Rule of Integrity Independence
Integrity constraints should be available and stored as metadata in data dictionary and not in the application programs.
Rule 11 − Rule of Distribution Independence
The Data Manipulation Language of the relational system should not be concerned about the physical data storage and no alterations should be required if the physical data is centralized or distributed.
Rule 12 − Rule of Non Subversion
Any row should obey the security and integrity constraints imposed. No special privileges are applicable.
Almost all full scale DBMSs are RDMSs. Oracle implements 11+ rules and so does Sybase. SQL Server also implements 11+ rules while FoxPro implements 7+ rules.
- Related Articles
- $F\ +\ V\ -\ E\ =\ 2$ and if $F\ =\ 20$, $V\ =\ 12$,Then find the value of $E$.
- E - Waste Rules, 2011
- Construct SLR (1) parsing table for the grammar\n1. E → E + T\n2. E → T\n3. T → T * F\n4. T → F\n5.F → (E)\n6.F → id
- Find FIRST & FOLLOW for the following Grammar\nE → E + T|T\nT → T ∗ F|F\nF → (E)|id
- Boyce–Codd Normal Form (BCNF)
- Safety Rules for Sewing
- RDBMS terminologies
- Find the canonical collection of sets of LR (0) items for Grammar -\nE → E + T\nE → T\nT → T * F\nT → F\nF → (E)\nF → id
- Rules for Java method overriding
- Find(a) \( 35-(20) \)(b) $72 – (90)$(c) $(– 15) – (– 18)$(d) $(–20) – (13)$(e) $23 – (– 12)$(f) $(–32) – (– 40)$
- Future of RDBMS
- If $f(x) = 2x^3 - 13x^2 + 17x + 12$, find$f(2)$
- If $f(x) = 2x^3 - 13x^2 + 17x + 12$, find$f(-3)$
- If $f(x) = 2x^3 - 13x^2 + 17x + 12$, find$f(0)$