Which type of efficient data structure is used in the internal storage representation in RDBMS?
Answer / 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 |
What is java priority queue?
Does arraylist extend list?
Which is better selection or bubble sort?
What is the logic to reverse the array?
Explain the uses of matrix with an example?
What is return map?
What is quick sort?
Describe tree rotation in avl tree.
What is the advantage of the heap over a stack?
What is entryset in hashmap?
What do you mean by data and data structure?
Differentiate between failfast and failsafe.