Which type of efficient data structure is used in the internal storage representation in RDBMS?
- 1 Answers
- 1110 Views
- Accenture, I also Faced
- E-Mail Answers
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 |
Which sort is best for linked list?
How do you increase the capacity of an arraylist?
What actions are performed when a function is called?
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?
What do you mean by Base case, Recursive case, Binding Time, Run-Time Stack and Tail Recursion?
Where is binary tree used?
Write the procedure to convert general tree to binary tree?
Why do we study data structures?
Differentiate between iterator and enumeration.
How do you find the depth of a binary tree?
Define linear data structures?
Which one is the simplest sorting in data structure?
Windows 
