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.
How persistent programming languages differ from traditional programming languages? Database languages vary from traditional programming languages in that they directly manipul
Control as a State Machine Engine First let us define the state machine: "the state machine is a machine which is an object but not an application object. It is a part of lang
Define the Canonical cover Ans: A canonical cover F c for F is a set of dependencies like F logically implies all dependencies in F c , and F c logically entails all dependen
Describe the static hash file with buckets and chaining and show how insertion, deletion and modification of a record can be performed. In static hash file organization, the wo
What is the use of group by clause? Group by clause is used to apply aggregate functions to a set of tuples. The attributes given in the group by clause are used to
it can be possible to create any table without primary key
Explain the Dynamic Hashing Techniques There are two methods in it: extendible hashing - stores an access structure in addition to the file, and therefore is somewhat identica
What is magnetic disks?explain it? Magnetic disk provides the bulk of secondary storage of modern computer system. The disk capacity is growing at over 50% per year. But the st
You are managing the following database system: • DBMS: Oracle 11g • OS: Sun Solaris • System architecture: Web-based application using ASP.Net • Purpose of Server: HR manage
Define Hash files organization a. Hashing includes computing the address of a data item by calculating a function on the search key value. b. A hash function h is a functi
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