recategorized
4,750 views

5 Answers

1 votes
1 votes

Answer: B (Root)

Explination:

  • The data is organize in a tree structure where the nodes represent the records and the branches of the tree represent the fields.
  • Since the data is organized in a tree structure, the parent node has the links to its child nodes.
  • If we want to search a record, we have to traverse the tree from the root through all its parent nodes to reach the specific record. Thus, searching for a record is very time consuming.
  • The hashing function is used to locate the root.
0 votes
0 votes
Option 4
0 votes
0 votes
Ans- D

Hash function & indexing is used to increase the speed of accessing the record in database. With help of key we directly jump the record in database. I.e h(k)

Related questions

0 votes
0 votes
5 answers
1
Pooja Khatri asked Jul 13, 2018
2,389 views
In RDBMS, which type of Join returns all rows that satisfy the join condition?Inner JoinOuter JoinSemi JoinAnti Join