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

MCQOPTIONS

1.	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
Answer» C. Look-up in B+ tree is straightforward and efficient

Discussion

No Comment Found

Related MCQs

THE_EXTENT_OF_THE_DATABASE_RESOURCE_THAT_IS_INCLUDED_WITH_EACH_LOCK_IS_CALLED_THE_LEVEL_OF?$
DBMS_periodically_suspends_all_processing_and_synchronizes_its_files_and_journals_through_the_use_of$
Which of the following is not true about B+ trees?
_______ means that data used during the execution of a transaction cannot be used by a second transaction until the first one is completed.
A condition that occurs when two transactions wait for each other to unlock data is known as a(n)
A lock that prevents the use of any tables in the database from one transaction while another transaction is being processed is called a
ANSI-standard SQL allows the use of special operators in conjunction with the WHERE clause. A special operator used to check whether an attribute value is null is
The most recent version of standard SQL prescribed by the American National Standards Institute is