Home » Tutorials » Hierarchical DBMS (HDBMS)

Hierarchical DBMS (HDBMS)

Our Categories

Blog Stats

  • 33,751 hits

Calendar

February 2013
M T W T F S S
« Jan   Mar »
 123
45678910
11121314151617
18192021222324
25262728  

Please visit SQLVERSITY.COM for more details.

A DBMS is said to be hierarchical DBMS, when the data is organized like a tree structure. That means, it simply represents the data using parent – child relationship. It is the oldest style of organizing/storing data and still some organizations are using this.

It follows one to many relationship. i.e. All parents can have more than one child, but each child should have only one parent.

All the records will be organized as per the relation between them. The parent record at the top of the tree structure is called the Root record. This parent record will be linked to all the related child records and each child record will be linked to a parent. In this type of DBMS, there is a drawback. If we want to add a new field or record, it may require to redefine the entire database in some cases.

XML document is the best example for hierarchical DBMS.

Please find the below to understand better about hierarchical DBMS.

Hierarchical DBMS

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: