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!
Strict 2PL:Though, this basic 2PL suffers from the trouble that it can result into loss of isolation / atomic property of transaction as theoretically speaking once a lock is released on a data item it can be changed by another transaction before the first transaction aborts or commits.
To leave such a situation we use strict two phase locking. The strict 2PL is graphically depicted in Figure. Though, the basic drawbacks of strict 2PL are that it restricts concurrency as it locks the item afar the time it is required by a transaction.
Figure: Strict Two Phase Locking
Does the two phase locking solve all the problems of concurrent transactions? No, the strict 2PL answers the problem of concurrency and atomicity, though it introduces another problem.
Draw the precedence graph of the following schedule and determine whether the schedule is serializable. (Note that all instructions, except lock and unlock, are omitted. We assume
Explain Derived and Non-Derived Attribute? In few cases, two or more attribute values are related, for instance, Age and BirthDate attributes of a person. For specific person e
Define average seek time. The average seek time is the average of the seek times, calculated over a sequence of random requests.
What is the difference between a key and a superkey? Key - A key a single attribute or a combination of two or more attributes of an entity set which is used to identify one
Explain the Deferred Update The deferred update methods do not physically update the database on disk till after a transaction reaches its commit point; after that the updates
System R was developed and designed over a period of 1974-79 at IBM San Jose Research Company. Its purpose was to illustrate that it is possible to create a Relational System tha
Views in relational algebra: 1. Basic expression contains either a) A relation in the database. b) A constant relation. 2. General expressions are madde out of sma
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
What is an Operand? The data on which the operation is to be performed is known as an Operand
What is recursion? Is it possible for a stored procedure to call itself or recursive stored procedure? How many levels of SP nesting is possible? Recursion is method of proble
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