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 |
How does a binary search work?
What is a matrix?
Can we add or delete an element after assigning an array?
What is precision in data structures?
Explain the expression trees?
What do you mean by Runtime Error
What are the advantages of linked list over an array?
What sort does arrays sort use?
Why is hashset not ordered?
What is data type explain?
What is a Queue? Explain its operation with example?
what is the biggest advantage of linked lists?