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!
Explain Two phase locking protocol
A transaction is consider as to follow the two-phase locking protocol if all locking operations precede the first unlock operation in the transaction. Such type of transaction can be divided into two phases: and expanding or growing (first) phase, throughout which new locks on items can be acquired but none can be released; and a shrinking (second) phase, throughout which existing locks can be released but no new locks can be obtained. This two-phase protocol can make sure the serializability because all the data items needed by a transaction will be locked at the starting of the transaction and if other transaction needs to use those data items then it has to wait till they become unlocked.
Define an operator that a Relational Algebra does not have Ans: Relational Algebra does not have Aggregation operators.
Distributed Database Management System
What are the objectives of query processing? Ans: The objectives of query processing is to transform a query written in a high level language into a accurate and efficien
Increased overheads on update : On the drawbacks side, it will need the system to ensure that all replicas of a relation are consistent. This shows that all the replicas of the rel
What is transaction? Transaction is a unit of program implementation that accesses and possibly updated several data items.
a) Suppose we updated the catalog tables in real time, that is, after every update, insert, or delete SQL statement were executed-rather than only running RUNSTATS once every few
Define Timestamp ordering Ans In timestamp-based method, a serial order is made among the concurrent transaction by assigning to every transaction a unique nondecreasing number
a method named WonGame that checks each letter in the word is matched by its label
Explain the Project-Join normal form A relation R is in PJNF along with respect to a set of functional dependencies D if for all join dependencies of the outline *(R 1 , R 2 ,
What are wait-for-graphs?Give the algorithm to construct a wait-for-graph from a given schedule of transactions? How can deadlocks be detected from wait-for-graphs? Ans: The
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