Which type of efficient data structure is used in the internal storage representation in RDBMS?
- 1 Answers
- 1255 Views
- Accenture, I also Faced
- E-Mail Answers
Answer / mamata nayak
B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching easier so for that we are using B+ tree.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is the order of b tree?
What is sort order?
Explain what are the types of collision resolution techniques and the methods used in each of the type?
How do you sort a list in reverse order?
Does the minimal spanning tree of a graph give the shortest distance between any 2 specified nodes?
What is collection process?
List the data structures which are used in rdbms.
Is vector synchronized?
Why linked lists are better than arrays?
Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))
33 Answers Amazon, Microsoft, Star Technologies, Sun Microsystems, Wipro,
Is duplicate allowed in hashmap?
What is the difference between hashmap and linkedhashmap?
Windows 
