Interested to Buy Any Domain ? << Click Here >> for more details...
Which type of efficient data structure is used in the internal storage representation in RDBMS?
- 1 Answers
- 1899 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 |
Why do we use dynamic arrays?
What is the default size of an arraylist?
Are collections thread safe?
What are the advantages of linked list over array (static data structure)?
What is the difference between static and dynamic data?
Can hashset contain null?
what are the applications of Linked Lists?
Why null is not allowed in treemap?
What is the best case time complexity of bubble sort?
What sort does arrays sort use?
What is array define its types?
Q#1: An algorithm is made up of 2 modules M1 and M2.If order of M1 is F(n) and order of M2 is g (n) then what is the order of the algorithm. Q # 2 : How many binary trees are possible with 3 nodes? with 4 nodes?
Windows 
