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!
Serialisable Schedules:If the processes of two transactions conflict with each other, how to verify that no concurrency related problems have happened? For this, serialisability theory has been developed. Serialisability theory attempts to verify the correctness of the schedules. The rule of this theory is:
"A schedule S of n transactions is serialisable if it is equal to some serial schedule of the similar 'n' transactions".
A serial schedule is a schedule in which either transaction T1 is totally done before T2 or transaction T2 is totally done before T1. For instance, the following figure clears the two possible serial schedules of transactions T1 & T2.
Schedule A: T2 followed by T1
Schedule B: T1 followed by T2
Schedule
T1
T2
Read X
Read Y
Subtract 100
Display X+Y
Write X
Add 100
Write Y
Figure: Serial Schedule of two transactions
Schedule C: An Interleaved Schedule
Figure: An Interleaved Schedule
Now, we have to figure out whether this interleaved schedule would be performing read and write in the same order as that of a serial schedule. If it does, then it is equivalent to a serial schedule, otherwise not. In case it is not equivalent to a serial schedule, then it may result in problems due to concurrent transactions.
Ask question #MinimThe Georgia Tech Library (GTL) has approximately 16,000 members, 100,000 titles, and 250,000 volumes (an average of 2.5 copies per book). About 10 percent of the
What is RDBMS terminology for a row? A tuple is a RDBMS terminology for a row
read-set(T) : Each data items that are read by a transaction T Timestamps : for all transaction T, the start-time and the end time are reserved for all the three phases.
Define the Division Operation of Relational Algebra Let R be a relation comprising attributes (A1,...Ap,Ap+1,...An) and S comprising attributes (Ap+1,...An) DEF: Division
What is a foreign key, and what is it used for? A foreign key is used to establish relationships between relations in the relational model. Technically, a foreign key is a colu
What is inheritance? Inheritance is an object orientation concept that allows reusability of code / design. Basic sense of inheritance is that if one class is predefined than a
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
Primary Index In primary index, there is a one-to-one relationship among the entries in the index table and the records in the major table. Primary index can be of two types:
What are the two methods for dealing deadlock problem? The two procedures for dealing deadlock problem is deadlock detection and deadlock recovery.
what is data link layer
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