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.
An entity type usually has an attribute whose values are distinct for every individual entity in the collection. Such an attribute is known as a key attribute and its values can be
Which sorting technique is used to sort databases, whose sizes are very big? Give one such algorithm. Why do sorting techniques like quicksort, insertion sort, etc. not applied
Q. Explain data aggregatio n and discuss different design constraints. Sol. Aggregation One limitation of the E-R model is that it cannot express relationships amon
What is the use of Union and intersection operation? Union: The result of this operation contains all tuples that are either in r1 or in r2 or in both r1 and r2.Duplicate tuple
WRITE SHORT NOTES ON INDEX STRUCTURE OF FILES? There are two basic parts of indices 1. Ordered indices 2. Hash indices Every technique must be evaluated on the bas
Problem: (a) Briefly explain the ‘Hierarchical Database Model' using appropriate diagram. (b) List and briefly describe five potential benefits of the database approach comp
Define Outer join Outer join - If there are any type of values in the one table that do not have corresponding value(s) in the other, in an equi-join which will not be selected
In Oracle what is system global area and how is it organized? The SGA is a collection of shared memory fields which along with the Oracle processes constitute an Oracle instan
What is nested relational model? The nested relational model is an extension of relational model in which domains might be either atomic or relation valued.
Write the motivations led to development of OO-DBMS? 1. Programmer frustration with RDBMSs. 2. Requirement for special features.
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