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
- 1370 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 do I sort hashset?
What are the different types of linked list?
Explain what are the major data structures used in the network data model?
What is a Queue? Explain its operation with example?
What are the five examples of data?
What is the difference between hashmap and arraylist?
Is bubble sort adaptive?
What is binary tree used for?
Define separate chaining?
Can we change load factor of hashmap?
What is data structure? Explain.
How do you assign an address to an element of a pointer array ?
Can we create a null as a key for a map collection?
Mention one advantage and disadvantage of using quadratic probing?
What is lifo?
