Q. Which of the following causes system to crash

View solution

Q. The database is partitioned into fixed-length storage units called

View solution

Q. The failure occurred sufficiently early during the transfer that the destination block remains intact.

View solution

Q. Which kind of failure loses its data in head crash or failure during transfer operation.

View solution

Q. The assumption that hardware errors and bugs in the software bring the system to a halt, but do not corrupt the nonvolatile storage contents, is known as the

View solution

Q. The transaction can no longer continue with its normal execution because of some internal condition, such as bad input, data not found, overflow, or resource limit exceeded. This is

View solution

Q. The system has entered an undesirable state (for example, deadlock), as a result of which a transaction cannot continue with its normal execution. This is

View solution

Q. Which of the following belongs to transaction failure

View solution

Q. Which one of the following is a failure to system

View solution

Q. The recovery scheme must also provide

View solution

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.

View solution

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

View solution

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

View solution

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.

View solution

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

View solution

Q. The deadlock can be handled by

View solution

Q. In crabbing protocol locking

View solution

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

View solution

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

View solution

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

View solution