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
- 1463 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
What is sort order?
Define rehashing?
Name the areas in which you can apply data structures extensively?
How many types of priority queue are there?
Provide an algorithm to reverse a linked list without using recursion.
Name some applications which use linked lists.
Why is bubble sort stable?
How to get top two numbers from an array?
Define 2-3-4 tree?
Explain binary tree traversals?
Why is hashset used?
Do you know what is linear search?
Can arraylist hold duplicates?
How do I sort hashset?
What is the best case for bubble sort?
