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.
I need help for my Uni assignments
Briefly explain each of the following database terms. Use no more than 2-3 lines for each term. 1. DBMS 2. Update Anomaly 3. Alias (referring to tables in SQL queries)
Describe Physical Data independence ? Physical Data Independence - It is capacity to modify the internal schema without having to change conceptual schema. Therefore, the exter
What is the difference between WHERE and HAVING clauses?. Predicates in the WHERE clause applies to every tuple while the predicate in the HAVING clause applies to groups.
Timestamp Ordering Protocol A timestamp is a tag that can be attached to any transaction or any data item, which indicates a specific time on which the transaction or data item
A distributed database is defined as "a collection of multiple logically interrelated database which are physically distributed over a computer network" (a) Give any three advan
Define outer union operation of the relational algebra. Compute the outer union for the relations R and S given below. Outer Join - If there are any values in one tabl
Why are cursors necessary in embedded SQL? A cursor is an object used to store the output of a query for row-by-row processing through the application programs. SQL statements
What is foreign key? A relation schema r1 derived from an ER schema may contain among its attributes the primary key of another relation schema r2.this attribute is known as a
..
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