Hierarchical model

1. One to many or one to one relationships.

2. Based on parent child relationship.
3. Retrieve algorithms are complex and asymmetric
4. Data Redundancy more
Network model

1. Many to many relationships.

2. Many parents as well as many children.
3. Retrieve algorithms are complex and symmetric
4. Data Redundancy more
Relational model

1. One to One,One to many, Many to many relationships.

2. Based on relational data structures.
3. Retrieve algorithms are simple and symmetric
4. Data Redundancy less

Hi,
Below are the graphical representation of all three models which helps you understand
more clearly:

1.) Hierarchical Model

2.) Network Model

3.) Relational Database Model

We hope that we answered your query correctly, for more information on Power BI and
other Business Intelligence tools, visit : Business Intelligence Consulting Services, Data
Analytics Company

ADVANTAGES OF RELATIONAL OVER HIERARCHACAL

MODEL
The relational model includes the concept of normalization of the data model,
which if you do it correctly gives you minimal redundancy of information, and
therefore minimizes anomalies.

Normalization also makes it possible to do joins, which makes it possible to do

different types of queries against the same data with equal efficiency.
For example, if you have  a database of Books and Authors with a many-to-many
relationship, you can query all Books written by a specified Author, or query all
Authors for a specific Book equally well.

In any non-relational data organization, querying one of these "directions" of the

relationship may be more efficient than the other.

Comparison between hierarchical model, network model

and relational model
Data models, Data structures, Data manipulation, Data integrity comparison

When we move with the data models such as hierarchical model, network model, relational model we can
identify number of difference in terms of data structures, Data manipulation and Data integrity.

Characteristic Hierarchical model Network model Relational model

Data structure
When we go through the structure of

the hierarchical model we can identify that it used a method for storing data in a
database that looks like a family tree with one root and a number of branches or
subdivisions. That's why we can say that record types are organized in the form
of a rooted tree. But in network model we can identify multiple branches
emanating from one or more nodes. So some times it is like a like several trees
which share branches. In relational model is that of a relation. Relation is a two-
dimensional table. So the table can be used to represent some entity information
or some relationship between them
Allowed the network model to One to One,
One to many or one to one
Data structure support many to many One to many, Many to
relationships
relationships many relationships
In hierarchical model only one-to-many or one-to-one relationships can be exist. But in network data model makes it
possible to map many to many relationships In relational each record can have multiple parents and multiple child
 records. In effect, it supports many to many relationships
Based on relational data
structures
Based on parent child A record can have many parents
Data structure
relationship as well as many children.
 

In hierarchical model relationship based in terms of parent child. So a child may only have one parent but a parent
can have multiple children. But in network data model a record can have many parents as well as many children.
Relational data model is based on relational data structures

Relational databases are

Does not provide an
Data CODASYL (Conference on Data what brings many sources
independent stand alone query
manipulation Systems Languages) into a common query
interface
(such as SQL)
In relational database it use powerful operations such as SQL languages or query by example are used to manipulate
data stored in the database But in hierarchical data model it does not
provide an independent stand alone query interface while network model uses CODASYL

Data retrieve algorithms are Retrieve algorithms are complex Retrieve algorithms are
manipulation complex and asymmetric and symmetric simple and symmetric
In hierarchical data model and network model retrieve algorithms are complex and symmetric But in relational data
model retrieve algorithms are simple and symmetric

Cannot insert the information

Does not suffer form any Does not suffer from any
Data integrity of a child who does not have
insertion anomaly. insert anomaly.
any parent.

In hierarchical data model we cannot insert the information of a child who does not have any parent. But in network
model does not suffer form any insertion anomaly. relational model does not suffer from any insert anomaly

Multiple occurrences of child

records which lead to Free form update
Data integrity Free from update anomalies.
problems of inconsistency anomalies
during the update operation
In network model it is free from update anomalies because there is only a single occurrence for each record set.In
relational model it also free form update anomalies because it removes the redundancy of data by proper designing
through normalization process. But in hierarchical model there are multiple occurrences of child records. which lead
to problems of inconsistency during the update operation

Deletion of parent results in Free from delete

Data intergirty Free from delete anomalies
deletion of child records anomalies

In hierarchical model it is based on parent child relationship and deletion of parent results in deletion of child
records .But in network model and in relational model it is free from deletion anomalies. Because information is
stored in different tables.
Posted
DBMS Database Models
A Database model defines the logical design and structure of a database and
defines how data will be stored, accessed and updated in a database management
system. While the Relational Model is the most widely used database model, there
are other models too:

 Hierarchical Model
 Network Model
 Entity-relationship Model
 Relational Model

Hierarchical Model
This database model organises data into a tree-like-structure, with a single root, to
which all the other data is linked. The heirarchy starts from the Root data, and
expands like a tree, adding child nodes to the parent nodes.
In this model, a child node will only have a single parent node.
This model efficiently describes many real-world relationships like index of a book,
recipes etc.
In hierarchical model, data is organised into tree-like structure with one one-to-many
relationship between two different types of data, for example, one department can
have many courses, many professors and of-course many students.
Network Model
This is an extension of the Hierarchical model. In this model data is organised more
like a graph, and are allowed to have more than one parent node.
In this database model data is more related as more relationships are established in
this database model. Also, as the data is more related, hence accessing the data is
also easier and fast. This database model was used to map many-to-many data
relationships.
This was the most widely used database model, before Relational Model was
introduced.
Entity-relationship Model
In this database model, relationships are created by dividing object of interest into
entity and its characteristics into attributes.
Different entities are related using relationships.
E-R Models are defined to represent the relationships into pictorial form to make it
easier for different stakeholders to understand.
This model is good to design a database, which can then be turned into tables in
relational model(explained below).
Let's take an example, If we have to design a School Database, then Student will be
an entity with attributes name, age, address etc. As Address is generally complex,
it can be another entity with attributes street name, pincode, city etc, and there will
be a relationship between them.
Relationships can also be of different types. To learn about E-R Diagrams in details,
click on the link.
Relational Model
In this model, data is organised in two-dimensional tables and the relationship is
maintained by storing a common field.
This model was introduced by E.F Codd in 1970, and since then it has been the
most widely used database model, infact, we can say the only database model used
around the world.
The basic structure of data in the relational model is tables. All the information
related to a particular type is stored in rows of that table.
Hence, tables are also known as relations in relational model.
In the coming tutorials we will learn how to design tables, normalize them to reduce
data redundancy and how to use Structured Query language to access data from
tables.