Interested to Buy Any Domain ? << Click Here >> for more details...
In RDBMS, what is the efficient data structure used in the internal storage representation?
- 1 Answers
- 1395 Views
- I also Faced
- E-Mail Answers
Answer Posted / rohit sah
B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching easier. This corresponds to the records that shall be stored in leaf nodes.
| Is This Answer Correct ? | 1 Yes | 0 No |
Post New Answer View All Answers
How is any data structure application is classified among files?
What is a property class?
What is a queue in data structure?
Explain recursive function & what is the data structures used to perform recursion?
Explain Array of pointers?
What is impact of signed numbers on the memory using data structures?
Which is faster treemap or hashmap?
What is the height of an empty tree?
Is red black tree balanced?
How does a hashmap work?
In tree construction which is the suitable efficient data structure?
How to copy an array into another array?
How do you use the sort function?
Which is the simplest file structure?
Explain linear linked implementation of Stack and Queue?
