FUNDAMENTALS OF COMPUTER

Detailed explanation-1: -1.1 Hierarchical Data Model In a hierarchical model, records are organized as trees rather than graphs, i.e., hierarchical model represents a hierarchy of parent and child data segments. It is represented by an upside-down “tree”.

Detailed explanation-2: -The hierarchical model was developed in the 1960s to manage large amounts of data for complex manufacturing projects such as the Apollo rocket that landed on the moon in 1969. Its basic logical structure is represented by an upside-down tree. The hierarchical structure contains levels, or segments.

Detailed explanation-3: -A hierarchical database model is a data model in which the data are organized into a tree-like structure. The data are stored as records which are connected to one another through links.

Detailed explanation-4: -In a hierarchical model, data are viewed as a collection of tables, or we can say segments that form a hierarchical relation. In this, the data is organized into a tree-like structure where each record consists of one parent record and many children.

Detailed explanation-5: -Examples of Hierarchical Database Systems IBM’s Information Management System (IMS) is an example of a hierarchical database system. Windows Registry is another such example. Another example that you may be aware of is XML data storage that we discussed earlier. XML has a root node enclosing one or more child nodes.