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 |
Explain the difference between a list and array.
Define a linear data structure.
Define hash table?
Why quicksort is faster?
Is array a collection?
What is array in data structure with example?
Is treemap sorted?
How do you sort large data?
Differentiate between compilers and interpreters.
What do you mean by primary clustering?
Write a program using mergesort technique.
What is difference between array and arraylist? When will you use array over arraylist?