In RDBMS, what is the efficient data structure used in the internal storage representation?
- 1 Answers
- 1103 Views
- I also Faced
- E-Mail Answers
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 |
Is bucket sort a comparison sort?
Explain different methods in which you can traverse a tree?
List out few of the Application of tree data-structure?
What is linear-logarithm chasm?
What is arrays copyof?
For which header list, the last node contains the null pointer?
What is the difference between static and dynamic data?
What are control structures?
Which sort algorithm is best?
What are AVL trees?
What is scalar example?
How can you insert a node to the beginning of a singly linked list?
Windows 
