Discussion
With this type of SQL Server cursor concurrency no lock is obtained until the user updates the data.
Answer: C
Correct answer: OPTIMISTIC
Optimistic concurrency takes no lock while the row is read and merely checks at update time whether the row has changed since. If it has, the update fails and the application must decide what to do. It assumes conflict is rare, which is what makes it faster than holding a lock through the whole read.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development