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

What is the difference between a stack and an array?

1068

What is a linear search?

1011

What should be done in the base case for this recursive problem?

889

How to reference all the elements in a one-dimension array?

1271

What is dequeue operation?

954

Define a stack?

1059

What is bubble sort technique?

870

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

875

Tell me about circular linked list?

925

Will this code give error if I try to add two heterogeneous elements in the arraylist? And why?

946

What is complexity algorithm?

872

What is bubble sort?

895

What is adt in data structure?

983

Define threaded binary tree.

1013

Does arraylist maintain insertion order?

821