____ ensures that once transaction changes are done, they cannot be undone or lost, even in the event of a system failure. ( ) Atomicity ( ) Consistency ( ) Durability ( ) Isolation 2. In this technique, deadlock is handled through request time out whenever a transaction that requests a lock has not been granted the lock for a system-defined period of time. What is this technique? ( ) Timeouts. ( ) Wait-die timestamps. ( ) Wound-wait timestamps. ( ) Wait-for-graph. 3. This concurrency problem occurs when one transaction T2 can see intermediate results of another transaction T1 before T1 has been committed. What is this problem? ( ) Lost update problem. ( ) Uncommitted dependency problem. ( ) Inconsistent analysis problem. ( ) Unrepeatable read problem. 4.A(n) ____ lock exists when concurrent transactions are granted Read access on the basis of a common lock. ( ) binary ( ) field-level ( ) shared ( ) exclusive 5.Which of the following is an integrity constraint in the logical data model? ( ) Required data. ( ) Attribute domain constraints ( ) Referential integrity. ( ) All of the above.

Database Systems: Design, Implementation, & Management
12th Edition
ISBN:9781305627482
Author:Carlos Coronel, Steven Morris
Publisher:Carlos Coronel, Steven Morris
Chapter10: Transaction Management And Concurrency Control
Section: Chapter Questions
Problem 15RQ
icon
Related questions
Question
  1. ____ ensures that once transaction changes are done, they cannot be undone or lost, even in the event of a system failure.
    ( ) Atomicity
    ( ) Consistency
    ( ) Durability
    ( ) Isolation

2. In this technique, deadlock is handled through request time out whenever a transaction that requests a lock has not been granted the lock for a system-defined period of time. What is this technique?
( ) Timeouts.
( ) Wait-die timestamps.
( ) Wound-wait timestamps.
( ) Wait-for-graph.

3. This concurrency problem occurs when one transaction T2 can see intermediate results of another transaction T1 before T1 has been committed. What is this problem?
( ) Lost update problem.
( ) Uncommitted dependency problem.
( ) Inconsistent analysis problem.
( ) Unrepeatable read problem.

4.A(n) ____ lock exists when concurrent transactions are granted Read access on the basis of a common lock.
( ) binary
( ) field-level
( ) shared
( ) exclusive

5.Which of the following is an integrity constraint in the logical data model?
( ) Required data.
( ) Attribute domain constraints
( ) Referential integrity.
( ) All of the above.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 7 steps

Blurred answer
Knowledge Booster
Concurrency control
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781305627482
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781285196145
Author:
Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel
Publisher:
Cengage Learning