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
- 1539 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 collection sort?
Explain what are the major data structures used in the hierarchical data model?
What is array and its types?
Why is the isempty() member method called?
List out the advantages of using a linked list?
What is the use of sorting?
How do you define a set?
State the difference between queues and linked lists?
Parenthesis is never required in postfix or prefix expressions, why?
What is binary tree used for?
Does set allow null values?
In depth questions regarding the data structures and the Databases used in the Projects developed.
What is the minimization factor and time complexity of b-tree?
Explain what are the notations used in evaluation of arithmetic expressions using prefix and postfix forms?
Describe the degree term in a tree.
