In RDBMS, what is the efficient data structure used in the internal storage representation?



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

Post New Answer

More Data Structures Interview Questions

Explain what are the major data structures used in the rdbms?

1 Answers  


Define Data Structures?

1 Answers  


Why do we need searching algorithms?

1 Answers  


How is heap sort implemented?

1 Answers  


Is Linked List 'linear' or 'Non-linear' data structure?

1 Answers   Accenture,


Write an algorithm for inserting and deleting an element from doubly linked list?

1 Answers  


What is the use of tree data structure?

1 Answers  


Can you store different types in an array?

1 Answers  


What is bubble sort algorithm in data structure sort and searching?

1 Answers  


How does quick sort work?

1 Answers  


How do you sort an arraylist?

1 Answers  


What is a hash in programming?

1 Answers  


Categories