...
Functional-Dependency
October 3, 2023
Database-Management-System
October 3, 2023
Functional-Dependency
October 3, 2023
Database-Management-System
October 3, 2023

Database-Management-System

Question 90

Which one of the following is a key factor for preferring B+– trees to binary search trees for indexing database relations?

A
Database relations have a large number of records
B
Database relations are sorted on the primary key
C
B+– trees require less memory than binary search trees
D
Data transfer from disks is in blocks
Question 90 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.
Correct Answer: D
Question 90 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.
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!