Which type of efficient data structure is used in the internal storage representation in RDBMS?
- 1 Answers
- 1496 Views
- Accenture, I also Faced
- E-Mail Answers
Answer Posted / mamata nayak
B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching easier so for that we are using B+ tree.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What are hash tables good for?
Are data structures important?
Is queue fifo or lifo?
What are the basic data structures?
List some applications of multilinked structures?
Mention for which header list, you will found the last node contains the null pointer?
What is the default value of Array?
Why heap sort is not used?
Differentiate between hashset and hashmap.
List the data structures which are used in network data modal.
Write a recursive c function to calculate the height of a binary tree.
Does hashset allow duplicates?
What is the difference between an array and vector?
What do you mean by shortest path?
Define secondary clustering?
