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
- 1810 Views
- Accenture, I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
Which is the simplest file structure?
Why concurrenthashmap is fail safe?
Discuss the difference between a stack and an Array?
Can a binary tree be empty?
Is list a data structure?
What is the easiest sorting method to use in data structures?
How many types of priority queue are there?
In what order the elements of a hashset are retrieved?
Which searching algorithm is best?
How does a dynamic array work?
What is type structure?
What is data structure operations?
Define balance factor of a node in avl tree?
What differences exist between hashmap and hashtable?
How do you assign an address to an element of a pointer array ?
