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
Discuss deferred update technique of recovery. What are the advantages? Ans: The deferred update methods do not physically update the database on disk till after a transact
Decompose the table with the following description and functional dependencies into a set of equivalent tables normalized to 3NF or BCNF. This database stores records from a (ve
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
It defines that the tuple in one relation that refers to another relation must refer to an existing tuple in that relation. This constraint is states on two relations (not essentia
What are the benefits of document scanning? Document scanning, in addition to being cost-efficient, also enhances productivity. This service enhances security as you set the pa
Explain the Check Clause The CHECK clause is employed to at the end of a CREATE TABLE statement specify table constraints. This is known as table-based constraint because it ap
Question: Consider the following database relations for a textbook ordering system used by a college bookshop: Book (b-copy#, bname, ISBN#, author, price, subject) Order (s#
Mixed fragmentation: Sometimes, horizontal fragmentation or vertical fragmentation of a database schema by itself is insufficient to sufficiently distribute the data for some appli
complete assignment on the above title.
Define single valued and multivalued attributes. Single valued attributes: attributes with a single value for a particular entity are known as single valued attributes. Mult
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