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!
What Is Recovery?
During the life of a transaction, i.e., a after the start of a transaction but before the transaction commits, various changes may be made in a database state. The database through such a state is in an inconsistent state. What occurs when a failure occurs at this stage? Let us define this with the help of an example:
Suppose that a transaction transfers Rs.2000/- from A's account to B's account. For simplicity we are not showing any error checking in the transaction. The transaction may be written as:
Transaction T1:
READ A
A = A - 2000
WRITE A
→ Failure
READ B
B = B + 2000
WRITE B COMMIT
What would occur if the transaction fails after account A has been written back to database? As far as the holder of account A is concerned s/he has transferred the money but that has never been taken by account holder B.
Why did this trouble occur? Because although a transaction is considered to be atomic, yet it has a life cycle during which the database gets into an inconsistent state and failure has happened at that stage.
What is the solution? In this situation where the transaction has not yet committed the changes made by it, the partial updates require to be undone.
How can we do that? By remembering information about a transaction such as when did it begin, what items it updated etc. All such details are occurred in a log file.
What is multiple relationship ?
what is binary relationship
Eliminate Columns Not Dependent On Key The Employee Relation satisfies - First normal form - As it has no repeating groups. Second normal form - As it do not have multi-a
Given the following relations TRAIN (NAME, START, DEST) TICKET (PNRNO., START, DEST, FARE) PASSENGER (NAME, ADDRESS, PNRNO.) Write SQL expressions for the following queries: No
What is the max. no. Of structures that can be included in a table or structure. Nine.
Define query optimization. Query optimization refers to the process of search the lowest -cost method of evaluating a given query.
What is a data dictionary? A data dictionary is a data structure which keeps Meta data about the structure of the database i.e. the schema of the database.
What are the drawbacks of shadow-paging technique? The drawbacks of shadow paging is:- a) Commit Overhead b) Data fragmentation c) Garbage collection
What is Nested Queries explain in details? Nested Queries - A SELECT query could have subquery(s) in it. While a SELECT query having another SELECT query in it, is known as n
Gaps in sequence values can happen when: - A rollback happens that is when a statement changes are not accepted. - When the system crashes - When a sequence i
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