In RDBMS, what is the efficient data structure used in the internal storage representation?
Page 1 of 1
In RDBMS, what is the efficient data structure used in the internal storage representation?
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.
Similar topics
» In tree construction which is the suitable efficient data structure?
» Of the following tree structure, which is, efficient considering space and time complexities?
» What is data structure?
» List out few of the Application of tree data-structure?
» What is the data structures used to perform recursion?
» Of the following tree structure, which is, efficient considering space and time complexities?
» What is data structure?
» List out few of the Application of tree data-structure?
» What is the data structures used to perform recursion?
Page 1 of 1
Permissions in this forum:
You cannot reply to topics in this forum
|
|