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.
Question: One of the tasks a database management system must perform is to ensure that the data is still intact in the face of software and hardware failure. This task is known
Example :; transfers transfer_amount from x's account to y's account ; Supposes x&y both accounts exist TRANSACTION (x, y, transfer_amount) Start transaction IF X AND Y
Explain the conventions (relationships) for displaying an ER schema as an ER diagram.
What is a heterogeneous distributed database? In a heterogeneous distributed database, dissimilar sites may use different schemas, and dissimilar dbms s/w. The sites may not be
Submit SQL INSERT Statements that will populate the database with sample data. You must insert at least 5 records into each table in your database.Submit your SQL INSERT Statement
3NF Normal Form A relation schema R is in 3NF if it is in 2NF and for each FD X A either of the following is true X is a Super-key of R. A is a prime attribute of R
When are they useful? Justify with an example. The temporary tables are commonly used to support specialized rollups or exact application processing needs. Unlike a permanent t
Ask question #Minim 100 words accepted#what is recovery management component in database management system and how it is useful
Use Access 2007 to create a database called UniLib.mdb. - this file should be created on your personal drive at the university (or C: if you're using Access 2007 at home) and t
Consider the following relational schema: Doctor(DName,Reg_no) Patient(Pname, Disease) Assigned_To (Pname,Dname) Give expression in both Tuple calculus and Domain calculus for
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