Suppose a transaction deletes a record, and the free space generated thus is allocated to a record inserted by another transaction, even before the first transaction commits. a. What problem can occur if the first transaction needs to be rolled back? b. Would this problem be an issue if page-level locking is used instead of tuple-level locking?

Suppose a transaction deletes a record, and the free space generated thus is allocated to a record inserted by another transaction, even before the first transaction commits. a. What problem can occur if the first transaction needs to be rolled back? b. Would this problem be an issue if page-level locking is used instead of tuple-level locking?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Describe what happens when phantoms appear. Why might this situation, despite the usage of the two-phase locking scheme, result in an improper concurrent execution?
Imagine for a minute that a financial institution's database is being safeguarded by the snapshot isolation database technique.Do you offer a concrete example of how a nonserializable execution may be detrimental to a bank? If so, please distribute it.
Provide a high-level intuition for why log records for transactions on the undo-list must be processed in reverse order, whereas redo is performed in a forward direction. What can go wrong if the undo-list is processed in a forward direction or redo is performed in a backward order?
Consider a multi-granularity locking system, with lock modes S, X, IS, IX, and SIX as in lecture and database-level, file-level, page-level and record-level locking as shown in the following figure. Provide the sequence of lock requests required to perform the following transactions and write necessary complete Lock and Unlock operations in their correct order. T3 want to read all pages in F1 and modify about 10 pages, which can be identified only after reading F1.(MY ANSWER) Lock-SIX(DB); Lock-S(F1); Lock-X(P1); Lock-X(P1000); Unlock(P1000); Unlock(P1); Unlock(F1); Unlock(DB); is it corect? ………………………………………………………………………………………
Many applications need to generate sequence numbers for each transaction. a. If a sequence counter is locked in two-phase manner, it can become a concurrency bottleneck. Explain why this may be the case. b. Many database systems support built-in sequence counters that are not locked in two-phase manner; when a transaction requests a sequence number, the counter is locked, incremented and unlocked. i. Explain how such counters can improve concurrency. ii. Explain why there may be gaps in the sequence numbers belonging to the final set of committed transactions.
Suppose we (incorrectly) modify the recovery algorithm of Section 19.4 tonote log actions taken during transaction rollback. When recovering from asystem crash, transactions that were rolled back earlier would then be includedin undo-list and rolled back again. Give an example to show how actions takenduring the undo phase of recovery could result in an incorrect database state.(Hint: Consider a data item updated by an aborted transaction and then updatedby a transaction that commits.)
Let's pretend a bank uses a technology called snapshot isolation to keep their database safe.Can you give an example of how the bank could be harmed by a nonserializable execution?
Suppose we wish to implement a transaction processing system that maintains ACID (atomicity, consistency, isolation, and durability) properties even in the presence of crashes. In event of a crash, any information stored on disk can be retrieved, but any data stored in memory will be lost. Briefly describe one serious shortcoming of each of the following implementations:i. The database is updated on disk with each transaction.ii. The database is kept in memory and on disk, with the copy on disk updated every 50 transactions.iii. The database is kept in memory. A log file is maintained on disk recording every transaction.
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.
Consider a database belonging to an airline that employs the technique known as "snapshot isolation," for instance. In the event that the overall performance of the airline is improved, it may be acceptable to tolerate executions that cannot be serialised.
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.
Obviously, it's cheaper to prevent deadlocks from occurring than it is to identify them after they've already occurred, but when is this the case?