Which type of efficient data structure is used in the internal storage representation in RDBMS?
- 1 Answers
- 1100 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 |
List out the applications of a linked list?
Can the double-checked locking fail on a single processor system?
Which data structures are applied when dealing with a recursive function?
How to sort 1 million floating point numbers?
Explain Linked List
What is the space complexity of selection sort?
What are the advantages of sorting?
Why do we Use a Multidimensional Array?
What is the minimization factor and time complexity of b-tree?
Calculate the address of a random element present in a 2d array, given base address as ba.
What is the difference between null and void?
What is 1d array?
Windows 
