In RDBMS, what is the efficient data structure used in the internal storage representation?
- 1 Answers
- 780 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 |
Which language is best to learn data structures?
What are the different types of hash functions?
Does stringutils isempty check for null?
How can I search for data in a linked list?
What do you mean by hash table?
How do you sort a collection in descending order?
What is the function of stack?
Explain quick sort and merge sort algorithms.
what is the need of data structure
Do you know how to find if linked list has loop?
How can a binary tree be represented using the rotation?
Is bucket sort stable?
Windows 
