A transaction is a unit of program execution that may occurs some error during execution such as if any transaction fail (due to any system fault or other reasons) at any state before committed Again sometimes, total amount before transaction and total amount after transaction may not same that means there is a difference between sending and receiving amount. Now Explain which properties of transaction is required to solve the problems in the given scenario.

A transaction is a unit of program execution that may occurs some error during execution such as if any transaction fail (due to any system fault or other reasons) at any state before committed Again sometimes, total amount before transaction and total amount after transaction may not same that means there is a difference between sending and receiving amount. Now Explain which properties of transaction is required to solve the problems in the given scenario.

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

When a stalemate occurs, those processes should be terminated, with the following outcomes:
Give an example of a circumstance when a user's total denial of a service—that is, the user receives no answer from the computer—is a serious issue. Describe a different scenario in which a 10% denial of service (i.e., the user's computation happens 10% slower than usual) causes significant issues. Is it feasible that unauthorised access to a computer system might prevent legitimate users from receiving 10% of their services? If that's true, how would you go about doing that?
Consider two transactions are using a joint account, j. The first transaction attempts to transfer money to b1 and the second transaction attempts to transfer money to b2. Discuss whether the following event can happen. 1) Lost update 2) Deadlock Use an appropriate example/scenario including the interleaving steps if an event can arise or provide a reason if it is not possible for an event to happen.
Explain optimistic and pessimistic timestamp ordering (TO) with an example scenario of two concurrent transactions. Computer science
Assume that two concurrent executing transactions T₁ and T₂ are allowed to update same stock item say 'A' in an uncontrolled manner. In such scenario. Give the problems no concurrency module and allows concurrent execution.
Explain optimistic and pessimistic timestamp ordering (TO) with an example scenario of two concurrent transactions.
In the event of an impasse, it becomes necessary to terminate said processes, thereby leading to the subsequent consequences:
Sometimes a transaction has to be undone after it has committed because it was erroneously executed—for example, because of erroneous input by a bank teller. a. Give an example to show that using the normal transaction undo mechanism to undo such a transaction could lead to an inconsistent state. b. One way to handle this situation is to bring the whole database to a state prior to the commit of the erroneous transaction (called point-in-time recovery). Transactions that committed later have their effects rolled back with this scheme. Suggest a modification to the recovery algorithm of Section 19.4 to implement point-in-time recovery using database dumps. c. Later nonerroneous transactions can be reexecuted logically, if the updates are available in the form of SQL but cannot be reexecuted using their log records. Why?
Consider a database system that includes an atomic increment operation, in addition to the read and write operations. Let V be the value of data item X.The operation increment(X) by C sets the value of X to V + C in an atomic step. The value of X is not available to the transaction unless the latter executes a read(X).Assume that increment operations lock the item in increment mode using the compatibility matrix in Figure 18.25.a. Show that, if all transactions lock the data that they access in the corresponding mode, then two-phase locking ensures serializability.b. Show that the inclusion of increment mode locks allows for increasedconcurrency.
Using the banker's algorithm, determine whether or not each of the following states is unsafe. If the state is safe, illustrate the order in which the processes may complete . a) if Available = (0, 3, 0, 1) for ABCD respectively b) If Available=(1,0,0,2) for ABCD respectively c) If P1 requests for (1,1,0,0), can the request be granted immediately in the scenario given above d) If P4 requests for (0,0,2,0), can the request be granted immediately? *
(b) Consider the following scheme to reduce message traffic in distributed deadlock detection. Transactions are assigned unique priorities, and an antagonistic conflict occurs when a transaction waits for a data object that is locked by a lower priority transaction. Deadlock detection is initiated only when an antagonistic conflict occurs. When a waiting transaction; (i) Determine the number of messages exchanged to detect a deadlock in the ‘best’ case.(ii) Determine the number of messages exchanged to detect a deadlock in the ‘average’ case.(iii) Determine the number of messages exchanged to detect a deadlock in the ‘worst-case’(iv) Determine the saving (in percentage) in the average number of messages exchanged under this message traffic reduction scheme as compared to when no such is used(c) Why does the interrupt disable method to achieve mutual exclusion not work for multiprocessor systems?(d) Consider a magnetic disk consisting of 16 heads and 400 cylinders. This disk has four…
6. A system is in a ______ state if there exists a set of transactions such that every transaction in the set is waiting for another transaction in the set. a. Idle b. Waiting c. Deadlock d. Ready