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
- 1369 Views
- I also Faced
- E-Mail Answers
In RDBMS, what is the efficient data structure used in the internal storage representation?..
Answer / 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 |
More Data Structures Interview Questions
Define balanced trees?
Is arraylist synchronized?
What is the use of isEmpty() member methods?
Why is hashmap faster?
What is binary tree? Explain its uses.
What method removes the value from the top of a stack?
How to find the duplicate in an array?
What do you mean by sorting?
What is meant by binary tree?
Explain Stack
How do you do binary search?
How does hashset work internally in java?
Windows 
