In RDBMS, what is the efficient data structure used in the internal storage representation?
Answer / rohit sah
B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching easier. This corresponds to the records that shall be stored in leaf nodes.
| Is This Answer Correct ? | 1 Yes | 0 No |
Which sorting technique is best in worst case?
How do you use the sort function?
What is the difference between data types and data structures?
Write an algorithm that counts number of nodes in the circular linked list
How do you do binary search?
Explain Array
What is the use of sorting?
What are arrays give example?
Give us a program to reverse a linked list.
State the demerits of linked representation of binary trees?
What is the best case complexity of quicksort?
Which data structure is applied when dealing with a recursive function?