...
Database-Management-System
August 29, 2024
Database-Management-System
August 29, 2024
Database-Management-System
August 29, 2024
Database-Management-System
August 29, 2024

Database-Management-System

Question 576
In a Hierarchical database, a hashing function is used to locate the .
A
Collision
B
Root
C
Foreign Key
D
Records
Question 576 Explanation: 
→ 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. A
record is a collection of fields, with each field containing only one value. The type of a record defines which fields the record contains.
→ 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.
→ In a Hierarchical database, a hashing function is used to locate the root node.
Correct Answer: B
Question 576 Explanation: 
→ 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. A
record is a collection of fields, with each field containing only one value. The type of a record defines which fields the record contains.
→ 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.
→ In a Hierarchical database, a hashing function is used to locate the root node.

Leave a Reply

Your email address will not be published. Required fields are marked *