DATABASE MANAGEMENT SYSTEM

TYPES OF DATA MODEL 

Hierarchical Model:

Structure:

Data is organized in a tree-like structure with a parent-child relationship.

Each parent can have multiple children, but each child has only one parent.

Example:

An example is the IMS (Information Management System) database.

Disadvantage:

Limited data relationships: The model primarily supports one-to-many relationships between parent and child records. This can be inflexible for complex data with many-to-many connections.

Network Model:

Structure:

Data is organized as a graph, allowing more complex relationships than the hierarchical model.

Entities are represented as nodes, and relationships are represented as links.

A node can have multiple relationships with other nodes.

Unlike the hierarchical model's one-to-many limitation, the network model allows a child record to have multiple parent records. This makes it adept at handling many-to-many relationships, providing a more accurate representation of interconnected data.

Example:

The CODASYL database management system is an example of a network model.

Graph Model:

Structure:

Similar to the network model but with more flexibility.

Nodes and edges (relationships) can have properties.

Well-suited for representing complex relationships in a more abstract way.

 

Example:

Graph databases like Neo4j use a graph model.

Each model has its own strengths and weaknesses, and the choice of model depends on the specific requirements of the application. Hierarchical and network models were more prevalent in earlier database systems, while graph databases are gaining popularity for applications with highly interconnected data, such as social networks, recommendation systems, and fraud detection. Relational databases, which use tables and follow the relational model, are also widely used and form the basis for many modern DBMS implementations.