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
- 1979 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 |
If we try to add duplicate key to the hashmap, what will happen?
Which sorting algorithm is worst?
What is bubble sort algorithm in data structure sort and searching?
An array having 100 elements have numbers from 1 to 99 randomly out of which any number is repeated. Find the repeated number in minimum time and space complexity.
Why is the isempty() member method called?
What is raid (redundant array of inexpensive disks)? Explain its level?
Why do we use arrays?
Can we create a null as a key for a map collection?
Discuss the difference between a stack and an Array?
What is comparator interface used for?
Is radix sort faster than quicksort?
What is difference between set and map?
Windows 
