Interested to Buy Any Domain ? << Click Here >> for more details...
In RDBMS, what is the efficient data structure used in the internal storage representation?
- 1 Answers
- 1424 Views
- I also Faced
- E-Mail Answers
Answer Posted / rohit sah
B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching easier. This corresponds to the records that shall be stored in leaf nodes.
| Is This Answer Correct ? | 1 Yes | 0 No |
Post New Answer View All Answers
Why it is important to have aligned addresses? What is the exception generated when there is a misaligned address?
Why does hashset use hashmap?
List the types of tree.
What is the minimum number of nodes in an avl tree of height h?
Draw the B-tree of order 3 created by inserting the following data arriving in sequence – 92 24 6 7 11 8 22 4 5 16 19 20 78
What is difference between hashset and treeset?
What is sorting an array?
What is time complexity of quick sort?
Name few classes that implement collection interface?
When is a graph said to be weakly connected?
Why is the isempty() member method called?
What is difference between array and arraylist?
Tell me what should be done in the base case for this recursive problem?
What are the different types of collections?
By Which algorithm, the 8 queens problem is solved?
