Database Systems: Design, Implementation, & Management
Database Systems: Design, Implementation, & Management
11th Edition
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
bartleby

Concept explainers

Question
Book Icon
Chapter 10, Problem 11P
Program Plan Intro

Pessimistic locking:

It is one of the locking methods in concurrency control. The lock exists in the transaction until the transaction gets committed or rolled back.

Two-phase locking protocol:

It defined the serializability of the transaction but not prevent deadlocks. The process of locking and unlocking can be done using two phases in this protocol. They are: Growing phase and shrinking phase.

Growing phase:

New lock can be occurred on the transaction without unlocking the data items. The data items are locked in this phase.

Shrinking phase:

This phase used to release all transaction but not provide new lock on the transaction.

Row-level lock granularity:

This row-level locking process used to lock the single row in the table. It is used to improve the availability of data and involving in transaction conflict.

Blurred answer
Students have asked these similar questions
What does it mean for a database to be in a stable state? While the database management system may give a symbolic meaning for a transaction, there is no assurance that it faithfully captures the underlying real-world event. What consequences may be expected if this ban were implemented? Explain your point using an illustration. Should we take at face value the apparent meaning of the phrase "serializable transactions"?
Suppose the deferred modification technique is used in a database. a. Is the old-value part of an update log record required any more? Why or why not? b. If old values are not stored in update log records, transaction undo. Is clearly not feasible. How would the redo-phase of recovery have to be modified as a result? C. Deferred modification can be implemented by keeping updated data items in local memory of transactions, and reading data items that have not been updated directly from the database buffer. Suggest how to efficiently implement a data item read, ensuring that a trans action sees its own updates.
When the application of an optimistic approach to concurrency control is implemented, it is frequently observed that transactions experience prolonged durations for completion. Explain?
Knowledge Booster
Background pattern image
Computer Science
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
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781305627482
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
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