A data model is a technique that supports abstraction for database functions by highlighting relevant entities and relationships while hiding unnecessary information. There are different types of data models, including hierarchical data models. The hierarchical data model organizes records in a tree structure, where each node can have multiple children but only one parent in a parent-child relationship. For example, components 2, 3, 4 are siblings in the hierarchical structure, and the path from the root node to any other node consists of its ancestors.

1. Click to edit Master title style
1
WELCOME TO DUCAT INDIA
70-70-90-50-90
info@ducatindia.com
What are Data Models?

2. Click to edit Master title style
2 2
A model is an abstraction procedure that hides superfluous information while highlighting
records pertinent to the software at hand. A data model is a technique that supports this
abstraction for database functions. Data modeling is used for performing entities of interest and
their relationship within the database. It permits the concept of the association between
numerous entities and their attributes. Different types of Data Models are available.
What are Data Models?

3. Click to edit Master title style
3
Types of Data Models
3

4. Click to edit Master title style
4
Hierarchical Data Model
Hierarchical Model was the first DBMS model. This model organizes the record in the hierarchical
tree structure. A tree is a data architecture that consists of an order of nodes, with an individual
node, known as the root, at the largest level.
A node might have any number of children, but each child node may additionally have only one
parent node in which it is dependent. The parent-to-child relationship in a tree is, therefore, a one-
to-many relationship, but the child-to-parent is one to one. The parent-child relationship is
displayed using drawing a line or edge between the parent and child nodes.
For example, components 2, 3, 4 are siblings. For any node, there is an individual path, known as
the hierarchical path from the root to that node. The nodes along this direction are known as
that node’s ancestors. Equally, for a given node, any node along a direction from that node to leaf
is referred to its descendent. The height of a tree is several levels in the deep hierarchical direction
from the root to a leaf. The tree in the figure has a height of 4. A tree is stated to be balanced in
every direction from the root node to a leaf that has a similar length.
4

5. Click to edit Master title style
5
Hierarchical Data Model
5

6. Click to edit Master title style
6
THANK YOU
6
70-70-90-50-90
info@ducatindia.com