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
Define identify relationship? Identifying relationship: An identifying relationship means in which the child table cannot be uniquely recognize without the parent. For exampl
i want notes on this topic
How many levels can be viewed in Architecture of the database ? Architecture of the database can be viewed as three levels.
Explain the Dynamic Hashing Techniques There are two methods in it: extendible hashing - stores an access structure in addition to the file, and therefore is somewhat identica
Describe Hashing in DBMS? Hashing: Hashing is a technique to store data within an array so which storing, searching, inserting and deleting data is fast (in theory it's O(1))
Explain Recursive relationship type? Recursive relationship type: A recursive relationship is one in that the similar entity participates more than once in the relationship
Explain Instance and schemas? Instances and schemas: Databases changes over time as the information is deleted and inserted. The collection of information stored in database
You are working for the ABC Telecom and are given some customer records for data mining. You are asked to discover, from the data, patterns that characterize low-, medium- and high
Differentiate between B-tree and B + tree Ans: A B-tree (or Balanced Tree) is a search tree along with additional constraints that makes sure that the tree is all the time
Define Deadlock detection If a system does not employ a few protocols that make sure deadlock freedom, after that a detection and recovery scheme should be used. An algorithm
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