Question

Which of the following is not true about B+ trees?

(a) B+ tree index takes the form of balanced tree

(b) Performance of B+ tree degrades as the file grows

(c) Look-up in B+ tree is straightforward and efficient

(d) Insertion and deletion in B+ tree is complicated but efficient

The question was posed to me in homework.

My question comes from Multiversion Schemes in section Concurrency Control of Database Management

Answer 1

Right answer is (b) Performance of B+ tree degrades as the file grows

Explanation: The answer is evident.