Which type of efficient data structure is used in the internal storage representation in RDBMS?
- 1 Answers
- 1256 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
Can a binary tree be empty?
What is unmodifiable list?
What is the difference between length () and size () of arraylist?
What are types of Collision Resolution Techniques and the methods used in each of the types?
Differentiate bfs and dfs?
Why is data structure used?
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
Which collection type is used to maintain uniqueness of data structure?
What is time complexity of binary search?
Can arraylist store primitives?
Define linked lists?
Can we use any class as map key?
Which sorting is best for large data?
What is array and string?
What is the difference between classifying and sorting?
