Question 947 – Nielit Scientist-B IT 4-12-2016
December 3, 2023Question 1193 – Nielit Scientist-B CS 22-07-2017
December 3, 2023Question 1195 – Nielit Scientist-B CS 22-07-2017
Which one of the following is a key factor for preferring B+-trees to binary search trees for indexing database relations?
- Database relations have a large number of records
- Database relations are sorted on the primary key
- B-trees require less memory than binary search trees
- Data transfer from disks is in blocks
Correct Answer: D
Question 42 Explanation:
A B+ tree is an N-ary tree with a variable but often large number of children per node. A B+ tree consists of a root, internal nodes and leaves.
The root may be either a leaf or a node with two or more children.
The primary value of a B+ tree is in storing data for efficient retrieval in a block-oriented storage context — in particular, filesystems.
This is primarily because unlike binary search trees, B+ trees have very high fanout (number of pointers to child nodes in a node,typically on the order of 100 or more), which reduces the number of I/O operations required to find an element in the tree.
The root may be either a leaf or a node with two or more children.
The primary value of a B+ tree is in storing data for efficient retrieval in a block-oriented storage context — in particular, filesystems.
This is primarily because unlike binary search trees, B+ trees have very high fanout (number of pointers to child nodes in a node,typically on the order of 100 or more), which reduces the number of I/O operations required to find an element in the tree.
Database relations have a large number of records
Database relations are sorted on the primary key
B-trees require less memory than binary search trees
Data transfer from disks is in blocks
Subscribe
Login
0 Comments