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.
An ideal data dictionary should have everything a DBA wants to know about the database. 1 Conceptual, External, and internal database descriptions. 2. Descriptions of attr
Explain Recursive relationship type? Recursive relationship type: A recursive relationship is one in that the similar entity participates more than once in the relationship
Determine the term- Active values An active value is that has dependent values. Every dependent value registers itself with active value that contains a set of dependent values
Security: Data not needed by local applications is not stored at the site, therefore no unnecessary security violations may exist. But how can we carry out fragmentation? Fragm
write-set(T): Each data items that are written by a transaction T
Define Two phase commit Two phase commit: To make sure atomicity, all the sites where a transaction is being executed must agree on the final outcome of the execution. The tran
Define in which normalisation form if an attribute of a composite key is dependent on an attribute of other composite key. Ans: 3NF A relation is in 3 NF if an attribute of
Prove that a relation which is 4NF must be BCNF. Ans Let R be in 4NF. Suppose it is not in BCNF. Hence, there exists an FD X→Y in R such that x is not a super key. Although
Question : (a) Data mining is one of the best ways to analyse data and using software method, hidden and unexpected patterns and relationships in sets of data can be extracte
Describe Query evaluation engine? Query Evaluation engine: Vehicle executes low-level instructions obtained through the DML compiler. The Storage Manager Components gives in
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