Which two statements are true about the B-tree Index?

Which two statements are true about the B-tree Index?
A. The leaf blocks in the index are doubly linked.
B. The leaf node stores a bitmap for each key value.
C. Rows with a NULL value in key columns also have entries in the Index.
D. The deletion of a row from the table causes a logical deletion in the index leaf block and the space becomes available for a new leaf entry.

Download Printable PDF. VALID exam to help you PASS.

Leave a Reply

Your email address will not be published. Required fields are marked *


The reCAPTCHA verification period has expired. Please reload the page.