In RDBMS, what is the efficient data structure used in the internal storage representation? Ans. 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. - Study24x7
Social learning Network

Warning: include(./views/auth.php): failed to open stream: Permission denied in /var/www/html/live/loginRightSlider.php on line 18

Warning: include(): Failed opening './views/auth.php' for inclusion (include_path='.:/usr/share/php') in /var/www/html/live/loginRightSlider.php on line 18

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
Ashish Verma
24 Apr 2023 12:56 PM study24x7 study24x7

In RDBMS, what is the efficient data structure used in the internal storage representation? Ans. 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.

Web Development
Like Comment Share
study24x7
Write a comment
Related Questions
500+   more Questions to answer

Get the App

Download the Study24x7 App, so you can connect and collaborate.

study24x7
study24x7
Most Related Articles