Which type of efficient data structure is used in the internal storage representation in RDBMS?
- 1 Answers
- 1121 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 is concurrentlinkeddeque?
How do you replace an element in an arraylist?
How do signed and unsigned numbers affect memory?
What are the benefits of using arrays?
Differentiate stack from array?
Write a Program for Insert in a sorted list
Is list a data type?
What is the maximum size of array?
What sort does arrays sort use?
Who invented merge sort?
What is shell sort in data structure?
Can you dynamically allocate arrays in expanded memory?
Which sorting is used in collections sort?
What is thread and types of thread?
What is difference between tree and forest?
