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
- 1381 Views
- I also Faced
- E-Mail Answers
Answer / 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 |
What is difference between hashmap and hashset?
What is the advantage of circular linked list?
What is the difference between one and two dimensional?
What is comparable interface?
What does arrays tostring do?
What is meant by a dynamic array?
List the differences between comparable and comparator interface?
What are the scenarios in which an element can be inserted into the circular queue?
What is data type with example?
Define threaded binary tree. Explain its common uses
Define hashing?
How many types of data structures are there?
Windows 
