Scribd
Upload
11 views3 pages

Data Model

Uploaded by

Swathi Senthilkumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
11 views3 pages

Data Model

Uploaded by

Swathi Senthilkumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

DATA MODEL:

Data modeling is the process of organizing your data into a structure, to make it more accessible and
useful. you’re deciding how the data will move in and out of your database and mapping the data so
that it remains clean and consistent.

Hierarchical

Network

Relational

Hierarchical :

the first implementation of hierarchical data model was developed by IBM called as IMS(information
management system).

It was developed for apollo space program to manage the vast amount of data associated with
manufacturing and project management in the late 1960s.

In a hierarchical model, data are viewed as a collection of tables. In this, the data is organized into a
tree-like structure where each record consists of one parent record and many children.

The parent record, called a “root node,” with multiple “child nodes” connecting to it through links.

Characteristic :

1. Tree Structure:

– The model organizes data into a tree-like structure, with a single

root from which all records descend.

2. Parent-Child Relationship:

– Each node (record) has a parent node and can have multiple

child nodes, but each child node has only one parent.

3. One-to-Many Relationships:

– It is designed to handle one-to-many relationships very efficiently.

4. Predefined Paths:

– Data retrieval follows predefined paths, making access to related

data fast but less flexible compared to more modern models.

Advantages
1. Simplicity:

– The hierarchical model is simple and easy to understand due to its

tree-like structure.

2. Efficiency in Retrieval:

– It allows for efficient data retrieval when dealing with hierarchical

data, as the path to access data is predefined.

3. Data Integrity:

– The strict parent-child relationships ensure data integrity and

prevent orphan records.

Network:

The network data model is an extension of the hierarchical data model, designed to address some of
its limitations.

Developed in the 1960s, it organizes data using a graph structure, allowing more complex
relationships between records.

This model is the generalization of the hierarchical model. This model can consist of multiple parent
segments. Mostly, there exists a many-to-many logical association between any of the two
segments.

Codasyl developed in late 1960s and published in 1971, provided the first formal description of the
network model.

Relational:

The relational data model is a foundational concept in modern database management systems.

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.
This model emphasizes data independence, consistency, and a high- level query language, making it
highly flexible and widely adopted.

You might also like