Question

Which of the following type of databases, data is organised in a tree-like structure?

• A. Network database
• B. Relational database
• C. Hierarchical database
• D. Distributed database

Hint:

A hierarchical database arranges data like a family tree—each child linked to one parent.

Answer 1

The Correct Option is C

Step 1: Understand the Structure of Database Models
Databases use different models to organize data:
Relational Database: Uses tables (rows and columns), and relationships are defined using keys.
Network Database: Represents complex many-to-many relationships using a graph-like structure.
Hierarchical Database: Organizes data in a tree-like structure where each record has a single parent (except the root).
Distributed Database: Data is stored across different physical locations.

Step 2: Key Characteristics of Hierarchical Databases
A hierarchical database uses a parent-child relationship, where:
Each parent can have multiple children.
Each child has exactly one parent.
It resembles an inverted tree with a root node and branches. Examples: IBM's Information Management System (IMS).

Step 3: Conclusion
Only the hierarchical database arranges data in a strict tree structure, making option (3) the correct answer.