A hierarchical database model stores data in a tree-like structure, with records connected through links. Each record can only have one parent but a parent can have multiple child records. The data is organized and accessed by traversing the tree from the root node down. This was the earliest database model developed by IBM in the 1960s and uses a parent-child relationship between records represented in a tree diagram.

5. Database is a collection of related data
and data is a collection of facts and
figures that can be processed to
produce information.
A database management system stores
data in such a way that it becomes
easier to retrieve, manipulate, and
produce information

6. A data model is a “description” of
both a container for data and a
methodology for storing and
retrieving data from container.
There are three different styles of database
management systems, each characterized by
the way data are defined and structured,
called database model.
A particular database management system
supports one of the four different architecture

7. Data base management
systems follow particular
models (known as
database models) to
store and manipulate
data. A data base model
is characterized by:
1. The way it
stores data :
STRUCTURE
2. The way
data in the
structure are
manipulated:
OPERATIONS

9. HIERARCHICAL
MODEL
NETWORK
MODEL
RELATIONAL
MODEL
OBJECT ORIENTED
MODEL
Note: Currently, Relational Model is most popular.
Our class will focus on HIERARCHICAL MODEL

10. MEANING: A hierarchical database model is a data model in which
the data is organized into a tree-like structure. The data is stored
as records which are connected to one another through links. A
record is a collection of fields, with each field containing only one
value. The entity type of a record defines which fields the record
contains.
EXPLANATION: The hierarchical database model mandates that each
child record has only one parent, whereas each parent record can
have one or more child records. In order to retrieve data from a
hierarchical database the whole tree needs to be traversed starting
from the root node. This model is recognized as the first database
model created by IBM in the 1960s.
NOTE: The terms parent and child are often used in describing a
hierarchical model

11. Developed by IBM, is the
oldest database model
Represented using a tree –
diagram(parent -child
relationship)
Each box is called a ‘node’
The nodes represent a record
type
A line connecting nodes
represents the link

14. Records have a parent-child
relationship
Child may have only on parent but
a parent have multiple children.
The user must know how the tree
is structured in order to find
anything!
Parents and children are tied
together by links are called
“pointers” (physical address inside
the file system)
High performance
Simple structure

15. Conceptual simplicity
Security: given by dbms
only
Simple creation,
manipulation and access
of data
Good database
integrity means data
related to proper manner
Data independence
Efficiency: produce high
performance database
Tedious to reorganize
Real life requirements
are more complex
Difficult to manage