The document discusses network models, emphasizing their benefits, such as the ability to handle many-to-many relationships and better data access compared to hierarchical models. It explains two key techniques: the shortest-route technique for finding the quickest path in a network and the maximal-flow technique for determining the maximum capacity of flow through a network. The network model's flexibility and conceptual simplicity make it suitable for representing complex real-life situations.

1. Network Models
Discuss the benefits provided by network modeling.
Describe how the shortest-route and maximal-flow techniques can be utilized. Please provide an
example of one of these techniques.
Solution
The network model is a database model conceived as a flexible way of representing objects and
their relationships. Its distinguishing feature is that the schema, viewed as a graph in which
object types are nodes and relationship types are arcs, is not restricted to being a hierarchy or
lattice.
The network model replaces the hierarchical model with a graph thus allowing more general
connections among the nodes.The main difference of the network model from the hierarchical
model is its ability to handle many to many relationships.In other words it allow a record to have
more than one parent.
BENEFITS OF NETWORK MODEL:
The major advantage of network model are-
Conceptual simplicity:
Just like the hierarchical model, the network model is also conceptually simple and easy to
design.
Capability to handle more relationship types:
The network model can handle the one to many and many to many relationships which is real
help in modeling the real life situations.
Ease of data access:
The data access is easier and flexible than the hierarchical model.
Data integrity:
The network model does not allow a member to exist without an owner.
Data independence:
The network model is better than the hierarchical model in isolating the programs from the
complex physical storage details.
Shortest Route Technique:

2. Definition:Shortest route technique can find the shortest path through a network.
For example: This technique can find the shortest route from one city to another through a
network of roads.
Steps of the Shortest-Route Technique:
Maximum Flow Technique:
Definition: The maximal-flow technique finds the maximum flow of any quantity or substance
through a network.
For example: This technique can determine the maximum number of vehicles (cars, trucks, etc.)
that can go through a network of roads from one location to another.
The maximal-flow technique allows the maximum amount of a material that can flow through a
network to be determined.
For example:
An example:
The Four Maximal-Flow Technique Steps: