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.
Deadlock And Its Prevention: As seen earlier, though two phase locking protocol handles the trouble of serialisability, but it causes some troubles also. For instance, consider th
Consider the relations City (city_name, state) Hotel (name, address) City_hotel (hotel_name, city_name, owner) Answer the following queries in relational algebra (i) Find
What are the various forms of data transparency? a) fragmentation transparency b) replication transparency c) location transparency
write-set(T): Each data items that are written by a transaction T
What are the two types of indices? The two types of indices are:- A) Dense index B) Sparse index
It can be easily defined as: The database must not have any unmatched foreign key values. The term "unmatched foreign key value" means a foreign key value for which there doe
Define What are the desirable properties of a decomposition Ans: What are the desirable properties of decomposition - dependency preserving. Because Lossless join and dependen
In the first unit of this block, you have been given with the details of the Database Management System, its structure, advantages etc. This unit is an attempt to give you informat
Concatenation operator Example : Printing name and job as one string as column name employees: SELECT ENAME||JOB "EMPLOYEES" FROM EMP;
4. Describe three ways to handle missing field values
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