Data Models

Data Model is the modeling of the data description, data semantics, and consistency constraints of the
data. It provides the conceptual tools for describing the design of a database at each level of data
abstraction. Therefore, there are following four data models used for understanding the structure of
the database:

1) Relational Data Model: This type of model designs the data in the form of rows and columns within a table.
Thus, a relational model uses tables for representing data and in-between relationships. Tables are also called
relations. This model was initially described by Edgar F. Codd, in 1969. The relational data model is the widely
used model which is primarily used by commercial data processing applications.

2) Entity-Relationship Data Model: An ER model is the logical representation of data as objects and
relationships among them. These objects are known as entities, and relationship is an association among these
entities. This model was designed by Peter Chen and published in 1976 papers. It was widely used in database
designing. A set of attributes describe the entities. For example, student_name, student_id describes the 'student'
entity. A set of the same type of entities is known as an 'Entity set', and the set of the same type of relationships
is known as 'relationship set'.

3) Object-based Data Model: An extension of the ER model with notions of functions, encapsulation, and
object identity, as well. This model supports a rich type system that includes structured and collection types.
Thus, in 1980s, various database systems following the object-oriented approach were developed. Here, the
objects are nothing but the data carrying its properties.

4) Semistructured Data Model: This type of data model is different from the other three data models
(explained above). The semistructured data model allows the data specifications at places where the
individual data items of the same type may have different attributes sets. The Extensible Markup
Language, also known as XML, is widely used for representing the semistructured data. Although
XML was initially designed for including the markup information to the text document, it gains
importance because of its application in the exchange of data.

What is a Hierarchical Data Model?

The hierarchical data model is the oldest type of the data model. It was
developed by IBM in 1968. It organizes data in a tree-like structure. Hierarchical
model consists of the following :
 It contains nodes which are connected by branches.
 The topmost node is called the root node.
 If there are multiple nodes appear at the top level, then these can be called
root segments.
 Each node has exactly one parent.
 One parent may have many children.

In the above figure, Electronics is the root node which has two children i.e.
Televisions and Portable Electronics. These two has further children for which
they act as parent. For example: Television has children as Tube, LCD and
Plasma, for these three Television act as parent. It follows one to many
relationship.
Advantages of the Hierarchical Data Model
 Because of its tree form, it is easy to grasp.
 Retrieving data in a one-to-many connection is efficient.
Disadvantages of the Hierarchical Data Model
 Inflexibility in reorganizing data.
 accessing complicated data structures may be challenging.
 redundant data storage, which might cause anomalies and inconsistencies.

What is a Network Data Model?
It is the advance version of the hierarchical data model. To organize data it uses
directed graphs instead of the tree-structure. In this child can have more than
one parent. It uses the concept of the two data structures i.e. Records and
Sets.
In the above figure, Project is the root node which has two children i.e. Project 1
and Project 2. Project 1 has 3 children and Project 2 has 2 children. Total there
are 5 children i.e Department A, Department B and Department C, they are
network related children as we said that this model can have more than one
parent. So, for the Department B and Department C have two parents i.e.
Project 1 and Project 2.
Advantages of the Network Data Model
 Because of its numerous parent ties, it is more adaptable than the
hierarchical approach.
 Ideal for managing intricate, many-to-many connections.
Disadvantages of the Network Data Model
 Increased complexity in database design and management.
 requires complex programming in order to manage and work with data.

What is a Relational Data Model?

The relational data model was developed by E.F. Codd in 1970. There are no
physical links as they are in the hierarchical data model. Following are the
properties of the relational data model :
 Data is represented in the form of table only.
 It deals only with the data not with the physical structure.
 It provides information regarding metadata.
 At the intersection of row and column there will be only one value for the
tuple.
 It provides a way to handle the queries with ease.
Advantages of the Relational Data Model
 High data independence and flexibility.
 offers robust and user-friendly querying features.
 removes duplication by use of normalization.
Disadvantages of the Relational Data Model
 For certain kinds of straightforward data retrieval tasks, they may not perform
as well as hierarchical models.
 demands a deeper comprehension of SQL and normalization principles.
Difference Between Hierarchical, Network and Relational
Data Model
Hierarchical Data
Model Network Data Model Relational Data Model

In this model, to store It organizes records in

data hierarchy method It organizes records to one the form of table and
is used. It is the oldest another through links or relationship between
method and not in use pointers. tables are set using
today. common fields.

To organize records, it It organizes records in the It organizes records in

uses tree structure. form of directed graphs. the form of tables.
 Hierarchical Data
Model Network Data Model Relational Data Model

In addition to 1:1 and

In addition to 1:1 and 1:n it
It implements 1:1 and 1:n it also implements
also implements many to
1:n relations. many to many
many relationships.
relationships.

The logical
Pointers are used to
A linked list is used to representation is used
establish relationships
establish a relationship with rows and columns
among records
among records physically. to depict relationship
physically.
among records.

Insertion anomaly exits

in this model i.e. child
There is no insertion There is no insertion
node cannot be
anomaly. anomaly.
inserted without the
parent node.

Deletion anomaly
exists in this model i.e. There is no deletion There is no deletion
it is difficult to delete anomaly. anomaly.
the parent node.

Update leads to Updating a record is

inconsistency easy and simple with
No such problem as only
problems because of the process of
one instance of records
the existence of normalization, the
exist.
multiple instances of a redundant data gets
child record. removed.

There is partial data

This model lacks data This model provides
independence in this
independence. data independence.
model.
 Hierarchical Data
Model Network Data Model Relational Data Model

No such facility for No such facility for

SQL-based declarative
querying database is querying database is
querying is supported.
supported. supported.

It is used to access the It is used to access the It is used to access the

data which is complex data which is complex and data which is complex
and asymmetric. symmetric. and symmetric.

Difficult to design a
It is easy to
database and manipulate
Difficult to design a comprehend due to
a database because of its
database because of concealed physical
complexity. Hence, it
its complexity. level details from end-
imposes a burden on the
users.
programmer.

It is flexible as
It is flexible as compared
It is less flexible. compared to the
to the hierarchical model.
hierarchical model.

VAX-DBMS, DMS-1100 of
It is mostly used in real
&XML and XAML use UNIVAC and
world applications.
this model. SUPRADBMS’s use this
Oracle, SQL.
model.