Which type of efficient data structure is used in the internal storage representation in RDBMS?



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

Post New Answer

More Data Structures Interview Questions

How to copy an array into another array?

0 Answers  


How would you use bsearch() function to search a name stored in array of pointers to string?

0 Answers  


What is a weighted graph?

0 Answers  


Write the importance of hashing?

0 Answers  


Tell me is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?

0 Answers  






What are the benefits of using arrays?

0 Answers  


What is binary tree example?

0 Answers  


List the data structures which are used in network data modal.

0 Answers  


How to create an Array?

0 Answers  


State the rules to be followed during infix to postfix conversions?

0 Answers  


What is the time complexity of arrays sort?

0 Answers  


Write a program to insert an element and in the specific position in the array?

0 Answers  


Categories