Which type of efficient data structure is used in the internal storage representation in RDBMS?
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 selection sort with example?
Name few collections map implementations?
Can we add heterogeneous elements into treemap?
What is a cycle or a circuit?
What is a subtree?
What is the need for extendible hashing?
What is stack push?
What are the advantages of sorting and filtering data?
What is the difference between a stack and an array?
What's the difference between an array and vector?
What is a subtree in data structures?
Is red black tree balanced?
Can you sort a hashmap?
Is it possible to make an array volatile in java?
Is pointer a variable in data structure?