Difference between revisions of "Hierarchical database model"

Latest revision as of 10:14, 23 August 2016

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

Description

A record is a collection of fields, with each field containing only one value. The entity type of a record defines which fields the record contains.

A record in the hierarchical database model corresponds to a row (or tuple) in the relational database model and an entity type corresponds to a table (or relation).

The hierarchical database model mandates that each child record has only one parent, whereas each parent record can have one or more child records.

In order to retrieve data from a hierarchical database the whole tree needs to be traversed starting from the root node.

This model is recognized as the first database model created by IBM in the 1960s.

See also

• Database
• Data model
• Hierarchical query
• Hierarchical clustering
• Tree structure

External links

• Hierarchical database model @ Wikipedia