B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, tha

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

Question Posted / mamata nayak

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

Please Help Members By Posting Answers For Below Questions

Why do we use different types of data structures?

942

What are b tree keys?

939

Does linkedhashset allow duplicates?

960

What is collection sort?

936

Which is faster list or set?

953

What is a hashset?

1135

Does list maintain insertion order?

941

Differentiate between queue and deque.

1003

Can you please explain the difference between string and an array?

1211

What are the properties of an algorithm?

1095

Are lists mutable?

1001

What is the difference between push and pop?

1150

Does treemap sort on key or value?

947

Is radix sort stable?

962

Write a program to reverse a link list.

988