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
- 1538 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 |
What sort does arrays sort use?
Why do we use a multidimensional array in data structure?
Define collision in hashing?
How do I sort a hashmap key?
Given M x N matrix with sorted elements row wise and column wise, find elements?
Does arraylist contain duplicates?
What is difference between data type and variable?
How to get top two numbers from an array?
What does sorting an array do?
What is time complexity of binary search?
How does hashset maintain order?
Can we search the data in a linked list?
Windows 
