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!
Failures and Recovery
In practice various things might occur to prevent a transaction from completing. Recovery methods are used to bring database, which does not satisfy consistency needs, into a consistent state. If a transaction finishes normally and commits then all the alters made by the transaction on the database are permanently registered in the database. They should not be lost. But, if a transaction does not finish normally and terminates abnormally then all the changes made by it should be discarded. An abnormal termination of a transaction may be because of various causes, including:
a) User may decide to terminate the transaction issued by him/ her
b) There may be a deadlock in the system
c) There may be a system failure.
The recovery mechanisms must make sure that a consistent state of database can be restored under all circumstances. In case of transaction terminate or deadlock, the system remains in control and can deal with the failure but in case of a system failure the system loses control because the computer itself has failed. Will the results of such type of failure be catastrophic? A database has a vast amount of useful information and any system failure should be recognised on the restart of the system. The DBMS should recover from some such failures.
What is Data Storage? The storage structures and access methods used by database system are specified by a set of explanation in a special type of DDL called data storage-defin
Explain the disadvantages of a file processing system? Ans: Disadvantages of File Processing Systems include: 1) Data Redundancy 2) Data Inconsistency 3) Difficult to acce
#ques Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a p
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
Project Description: Hi I'm seeking someone to make my dBase application work. I know it's not a 'modern' language but it's what I know. I have written an order program and I ne
" 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
Define the Wait for graph Ans: The wait-for-graph is a directed graph and consist of nodes and directed arcs; the nodes of the graph are active transactions. An arc of the grap
Define the concept of aggregation. Give two examples where this concept is useful. Ans: Aggregation transforms a relationship among the objects into a higher-level object. A
What is a query tree? Ans: A query tree, as well known as operator graph, is a tree data structure that corresponds to a relational algebra expression. It denotes the inpu
What is a Phantom Deadlock? In distributed deadlock detection, the delay in propagating local information might cause the deadlock detection algorithms to recognize deadlocks
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