Machine-translated by Google. Questions are authored in English.
Top

Discussion

Which one is true statement :

  • A.With finer degree of granularity of locking a high degree of concurrency is possible.
  • B.Locking prevents non-serializable schedules.
  • C.Locking cannot take place at field level.
  • D.An exclusive lock on data item X is granted even if a shared lock is already held on X.

Answer: A

Correct answer: With finer degree of granularity of locking a high degree of concurrency is possible

Locking a smaller unit - a row rather than a table - leaves more of the data free for other transactions, so concurrency rises; the cost is more locks to manage. The other statements are false: plain locking does not by itself prevent non-serializable schedules, field-level locking is possible, and an exclusive lock is refused while a shared lock is held.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.