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.
Chapter 1 - Profile for the Organization You have to select an organization of your choice and assume that you work for that organization. Now you must prepare a brief profile of t
Explain in details about the f unctions of DBA ?
File Organisation In Dbms Introduction Databases are used to store information. Usually, the principal operations we have to perform on database are those relating to:
What is a hash index? A hash index organizes the search keys, with their associated pointers, into a hash file structure.
Use of partial data by applications : In common, applications work with views rather than whole relations. Thus, it may be more appropriate to work with subsets of relations rather
Explain the B + tree? B + tree is a type of tree which denotes sorted data in a way that permits for efficient insertion, retrieval and removal of records, each of which is
What is the difference between WHERE and HAVING clauses?. Predicates in the WHERE clause applies to every tuple while the predicate in the HAVING clause applies to groups.
definition and its work
What is Asterisk in SQL? Asterisk (*): In SQL, the columns for all the tables and views in the FROM clause will be displayed.
Consider a bank that has a collection of sites, each running a database system. Suppose the only way the databases interact is by electronic transfer of money between one another,
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