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!
"Wound-wait" scheme: It is based on a preemptive method. It is based on a simple rule:
If Ti requests a database resource that is held by Tj
then if Ti has a larger timestamp (Ti is younger) than that of Tj
it is allowed to wait;
else Tj is wounded up by Ti.
For example, suppose that 3 transactions T1, T2 and T3 were generated in that series, then if T1requests for a data item which is presently held by transaction T2, then T2 is rolled back and data item is allotted to T1 as T1 has a smaller time stamping than that of T2. Though, if T3 requests for a data item which is presently held by transaction T2, then T3 is permitted to wait.
Figure: Wound-wait Scheme of Deadlock prevention
It is vital to see that whenever any transaction is rolled back, it would not make a starvation condition, i.e., no transaction gets rolled back repeatedly and is never permitted to make progress. Also both "wait-die" & "wound-wait" idea avoid starvation. The number of aborts & rollbacks will be higher in wait-die scheme than in the wound-wait idea. But one main problem with both of these ideas is that these ideas may result in unnecessary rollbacks.
Define and differentiate between ordered indexing and hashing. Ans: Ordered indexing: To gain fast random access to records in a file, we can make of an index structure. Every
The Second Normal Form (2NF) Definition: A relation is in 2NF if it is in 1NF and each non-key attribute is fully dependent on each candidate key of the relation. Some of th
What are the three data anomalies that are likely to occur as a result of data redundancy? Can data redundancy be completely eliminated in database approach? Why or why not? A
What is indexed sequential file organization? What are the applications of this organization? Ans: An index file can be employed to effectively overcome the problem of storing
What is a recursive relationship? Give an example not used in the text. A recursive relationship is a relationship among an entity and itself. For example, given the entity PER
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
The Internal or Physical Level The collection of files permanently stored on secondary storage devices is called as the physical database. The internal or physical level is t
Differentiate between the object oriented decomposition and the structured decomposition? Process-oriented (structural) decomposition divides a complex process, function or tas
Define an operator that a Relational Algebra does not have Ans: Relational Algebra does not have Aggregation operators.
Describe Hashing in DBMS? Hashing: Hashing is a technique to store data within an array so which storing, searching, inserting and deleting data is fast (in theory it's O(1))
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