Hierarchical database system

 
 
 
 
 

 
 
Camilo Alexander Hernandez Hernandez
Nelson Esteban Escarraga Escobar
Students
 
 
 
 
 
 
 
 
 
 
 
 
 
 
Pilot University of Colombia Sectional of Alto Magdalena
Database Systems Area
Girardot
 2020
Hierarchical database system
 
 
 
 

 
Camilo Alexander Hernandez Hernandez
Nelson Esteban Escarraga Escobar
Students
 
 
 
 
 
Marco Tulio Sanchez
Teacher
 
 
 
  
 
 
 
Pilot University of Colombia Sectional of Alto Magdalena
Database Systems Area
Girardot
2020
Hierarchical databases
By1: Camilo Hernandez, Nelson Escarraga
 
A database, or also called a database, is a set of information that is part of the same context and is
systematically stored for later use. On the other hand, a hierarchical database is one that by its structure allows
to store information in a structure similar to that of binary search trees, that is, it consists of a parent node and a
series of dependencies or children, equally to the node that has no parent is called root and nodes that do not
have children are called leaves.
Figure. Hierarchical model image

 
Source: (THE HIERARCHICAL DATA MODEL, 2012)
 
 
 
Hierarchical databases are generally used in cases where the volume of information handled is high, so it is
possible to develop structures of a high degree of stability and performance, instead one of the main
shortcomings presented by this model is its inability to deal efficiently with information redundancy. It can also
be said that this model is rigid, due to its close parent/child relationship, since the parent may have one or more
children while the children can only relate to their father and not to nodes that are part of their peer.

 
Features

 When a parent record is deleted, all child records (data integrity) must be deleted.
  Any child record must have a single parent record except the root.
 
 Many-to-Many relationships require information redundancy.
 
 
 
 
 
 
 
 
 
Parts
 
1) PARENT SEGMENT: It is the one who has descendants, all located on the same level.
 

 
2) CHILD SEGMENT:
This is one that depends on a top-level segment. All the children of the same parent are on the
same level of the tree. 
 
  
 
 
 
 
 
 
 
 
3) ROOT SEGMENT:
The root segment of a hierarchical database is the parent that has no parent. The root is always
unique and occupies the top level of the tree. 
 

 
3) ROOT SEGMENT:
The root segment of a hierarchical database is the parent that has no parent. The root is always
unique and occupies the top level of the tree. 
  
Advantages

1) It is easy to see the structure of the database.

  
2) Its implementation is simple and quick to implement.
 
3) Relationships can be predefined, simplifying future variations.
 
 
Disadvantages

1)The waste of space is inevitable.

 
2) It has the disadvantage that in-depth knowledge of the information units and their relationships to each other
is necessary.
 
3) Insert and delete operations are complex.
 
Conclusions

In conclusion, we can say that unlike the relational model, the hierarchical model does not distinguish a logical
view from a physical view of the database. So relationships between data are always established in all
circumstances on a physical level.
 
hierarchical database is a genre of database management system that, as its name points out, stores information
in a hierarchical structure that binds records in the form of a tree structure (akin to a tree seen upside down)