Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
The Concurrent Transactions
Almost every commercial DBMS support multi-user environment. Therefore, allowing multiple transactions to proceed concurrently. The DBMS must make sure that two or more transactions do not obtain into each other's way, i.e., transaction of one user doesn't effect the transaction of other or even the transactions issued by the similar user should not get into the way of each other. Be advised that concurrency related problem may happen in databases only if two transactions are contending for the similar data item and at least one of the concurrent transactions wishes to update a data value in the database. In this, the concurrent transactions only read similar data item and no updates are done on these values, then it does NOT create any concurrency related difficulty. Now, let us talk about why you require a mechanism to control concurrency.
Consider a banking application dealing with saving and checking accounts. A Banking Transaction T1 for Mr. Sharma moves Rs.100 from his checking account balance X to his savings account balance Y, using the transaction T1:
Transaction T1:
A: Read X
Subtract 100
Write X
B: Read Y
Add 100
Write Y
Let us assume an auditor wants to know the total assets of Mr. Sharma. He implements the following transaction:
Transaction T2:
Read X Read
Y Display
X+Y
Assume both of these transactions are issued concurrently, and then the implement of these instructions can be combined in many ways. This is also known as the Schedule. Let us describe this term in more detail.
A schedule S is described as the sequential ordering of the operations of the 'n' interleaved transactions. A schedule keeps the order of operations within the individual transaction.
One possible schedule for interleaved execution of TA and TB
what is Lossless-join decomposition
Modular growth: In distributed environments, it is simple to expand. Latest sites can be added to the network without affecting the operations of other sites, as they are somewhat
Conversion of entity sets: I) For every strong entity type E in the ER diagram, we make a relation R containing all the easy attributes of E. The relation R pri
Briefly describe the different kinds of users of a DBMS. Ans: Different sorts of DBMS users are: (a) Software Engineers: These are the people accountable for developing ap
A set of possible data values is called? A set of possible data values is called as domain.
What do you mean by atomicity and aggregation? Atomicity : Either all actions are carried out or none are. Users should not have to worry about the effect of incomplete trans
What is the meaning of Data independence? Data independence means a programs that are not dependent on the physical attributes of data and a programs that are not dependent on
Fourth Normal Form (4NF) When attributes in a relation have multi-valued dependency, further Normalization to 4NF and 5NF are needed. Let us first find out what multi-valued d
Define the Wait for graph Ans: The wait-for-graph is a directed graph and consist of nodes and directed arcs; the nodes of the graph are active transactions. An arc of the grap
Explain the difference between the three storage types - volatile, non volatile and stable. Ans: Volatile storage: if storage media loses data while power goes off,
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd