Which type of efficient data structure is used in the internal storage representation in RDBMS?
- 1 Answers
- 1487 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 |
What is non linear data structure with example?
Why do we Use a Multidimensional Array?
How do you find the length of an arraylist?
What do you mean by the term “percolate down”?
How does hashset maintain order?
write an algorithm to show the procedure of insertion into a b-tree?
How many null values are allowed in a set?
What is copyonwritearraylist?
How do you access the values within an array?
How do you sort an array by value?
Explain multiply linked list in short.
Which sorting algorithms are in place?
Windows 
