Functional-Dependency
October 3, 2023GATE 2005
October 3, 2023GATE 2005
| Question 28 |
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 |
Question 28 Explanation:
B+ trees is a balanced tree and it can store multiple keys in each node of B+ tree.
Thus, the data can be transferred through blocks in B+ trees. This can be used for indexing the database relations.
Thus, the data can be transferred through blocks in B+ trees. This can be used for indexing the database relations.
Correct Answer: D
Question 28 Explanation:
B+ trees is a balanced tree and it can store multiple keys in each node of B+ tree.
Thus, the data can be transferred through blocks in B+ trees. This can be used for indexing the database relations.
Thus, the data can be transferred through blocks in B+ trees. This can be used for indexing the database relations.