adplus-dvertising
frame-decoration

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

Posted under DBMS

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

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

Q. The extent of the database resource that is included with each lock is called the level of

Q. Snapshot isolation is a particular type of ______________ scheme.

Q. Snapshot isolation is used to give

Q. Lost update problem is

Q. Under first updater wins the system uses a __________ mechanism that applies only to updates.

Q. When a transaction Ti attempts to update a data item, it requests a _________ on that data item.

Q. Each of a pair of transactions has read data that is written by the other, but there is no data written by both transactions, is referred to as

Q. An application developer can guard against certain snapshot anomalies by appending a ______ clause to the SQL select query.

Q. Evaluate the CREATE TABLE statement:

CREATE TABLE products
(product_id NUMBER(6) CONSTRAINT prod_id_pk PRIMARY KEY, product_name VARCHAR2(15));

Which statement is true regarding the PROD_ID_PK constraint?

Q. Evaluate the following CREATE SEQUENCE statement:

CREATE SEQUENCE seq1
START WITH 100
INCREMENT BY 10
MAXVALUE 200
CYCLE
NOCACHE;

The sequence SEQ1 has generated numbers up to the maximum limit of 200. You issue the following SQL statement:

SELECT seq1.nextval FROM dual;

What is displayed by the SELECT statement?

Q. The method of access that uses key transformation is called as

Q. Why do we need concurrency control on B+ trees ?

Q. How many techniques are available to control concurrency on B+ trees?

Q. In crabbing protocol locking

Q. The deadlock can be handled by

Q. In crabbing protocol the the lock obtained on the root node is in _________ mode.

Q. If needed to split a node or coalesce it with its siblings, or redistribute key values between siblings, the crabbing protocol locks the parent of the node in ____________ mode.

Q. In crabbing protocol to inset or delete a key value the leaf node has to be locked in ___________ mode.

Q. B-link tree requires a pointer to its __________ sibling.

Q. Instead of locking index leaf nodes in a two-phase manner, some index concurrency-control schemes use ___________ on individual key values, allowing other key values to be inserted or deleted from the same leaf.