Type of Database ModelThere are many types of database models. Some of them are outdated and some are heavily used. In modern days, one most common model is Relational model.
- Relational model
- Hierarchical database model
- Network model
- Object-oriented database model
- Entity-relationship model
- Document model
- Entity-attribute-value model
- Star schema
- Object-relational model
Relational ModelFirst thing first; why it’s name is relational ? Because it is based on a pure mathematical concept “Relations” in “Set theory“. This was indeed invented by E.F Codd, an English computer scientist who, while working for IBM, first realized that the discipline of mathematics could be used to inject some solid principles and rigor into the field of database management system.Note: Before going to the original theory of the relational model you should be already aware of some terminologies in Set Theory E.g Relation, Attribute, Tuple,which are also involved with this model.
By definition, the fundamental assumption of the relational model is that all data is represented as mathematical n–ary relations, an n-ary relation being a subset of the Cartesian product of n domains. In the mathematical model, reasoning about such data is done in two-valued predicate logic, meaning there are two possible evaluations for each proposition: either true or false (and in particular no third value such as unknown, or not applicable, either of which are often associated with the concept of NULL). Data are operated upon by means of a relational calculus or relational algebra, these being equivalent in expressive power.A relation is defined as a set of n-tuples. In both mathematics and the relational database model, a set is an unordered collection of unique, non-duplicated items. An n-tuple is a sequence (or ordered list) of n elements, where n is a non-negative integer.Later on, when the SQL language was introduced as a way to interact with relational databases. In SQL, the terms “relation”, “attribute”, “tuple” got replaced with generally more understandable terms: “table”, “column”, “row”.A common misconception is that the name “relational” has to do with relationships between tables. A relation in the relational model is what SQL calls a table. The two are not synonymous. You could say that a table is just an attempt by SQL to represent a relation for ease visualisation of data for developers. However SQL deviates a lot of rules from the pure Relational model given by Codd. Read here to know what are those points. To avoid such deviation, Codd came up with twelve rules of his own, which according to him, a database must obey in order to be regarded as a true relational database.
Codd’s 12 rules:Rule 0: The foundation rule:
- For any system that is advertised as, or claimed to be, a relational database management system, that system must be able to manage data bases entirely through its relational capabilities.
- All information in a relational database is represented explicitly at the logical level and in exactly one way – by values in tables.
- Each and every datum (atomic value) in a relational data base is guaranteed to be logically accessible by resorting to a combination of table name, primary key value and column name.
- Null values (distinct from the empty character string or a string of blank characters and distinct from zero or any other number) are supported in fully relational DBMS for representing missing information and inapplicable information in a systematic way, independent of data type.
- The data base 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.
- A relational system may support several languages and various modes of terminal use (for example, the fill-in-the-blanks mode). However, there must be at least one language whose statements are expressible, per some well-defined syntax, as character strings and that is comprehensive in supporting all of the following items:
- Data definition.
- View definition.
- Data manipulation (interactive and by program).
- Integrity constraints.
- Transaction boundaries (begin, commit and rollback).
- All views that are theoretically updatable are also updatable by the system.
- 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.
- Application programs and terminal activities remain logically unimpaired whenever any changes are made in either storage representations or access methods.
- 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.
- Integrity constraints specific to a particular relational database must be definable in the relational data sublanguage and storable in the catalog, not in the application programs.
- The end-user must not be able to see that the data is distributed over various locations. Users should always get the impression that the data is located at one site only.
- If a relational system has a low-level (single-record-at-a-time) language, that low level cannot be used to subvert or bypass the integrity rules and constraints expressed in the higher level relational language (multiple-records-at-a-time).