Explain the timestamps for read operations, Database Management System

Timestamps For Read operations:

If TS (T) < W-timestamp (Q), then the transaction T is trying to read a value of data item Q which has already been overwritten by some other transaction. As the value which T wanted to read from Q does not be there anymore, and T would be rolled back.

If TS (T) >= W-timestamp (Q), then the transaction T is trying to read a value of data item Q which has been written and committed by some other transaction earlier. As T will be allowed to read the value of Q, and the R-timestamp of Q should be updated to TS (T).

 

Posted Date: 7/26/2013 7:19:31 AM | Location : United States







Related Discussions:- Explain the timestamps for read operations, Assignment Help, Ask Question on Explain the timestamps for read operations, Get Answer, Expert's Help, Explain the timestamps for read operations Discussions

Write discussion on Explain the timestamps for read operations
Your posts are moderated
Related Questions
what do you mean by consistency in rdbms?

What is meant by heuristic optimisation?  Discuss the main heuristics that are applied during query optimisation.  Ans:  In heuristic optimization, heuristics are employed to r

Foreign Keys and NULL Let us take the relation:                 DEPT DEPT ID DNAME BUDGET D1 M

Implementing software control To implement software control designer must redesign strategy of state event model which is present in dynamic model. There are three basic ap

We need help in Booking System for Golf Business Development of a web based booking system which permits clients to book golf lessons with the following features- a) 4 user p

construct an er diagram for a hospital with a set of patients and a set of medical doctors. associate with each patient a log of various test and examination conducted.convert er d

Define Deadlock detection If a system does not employ a few protocols that make sure deadlock freedom, after that a detection and recovery scheme should be used. An algorithm

Explain Strict Two-Phase locking A transaction T does not release any type of its exclusive (X) locks until that transaction commits or aborts. In this method no other transact

Consider the subsequent relation schemes:  Project (Project#, Project_name, chief_architect)  Employee (Emp#, Empname)  Assigned_To (Project#, Emp#)  Give expression i

All edges of a cube are expanding at a rate of 6 centimeters per second. How fast is the surface area changing when each edge is (a) 2 centimeters and (b) 10 centimeters?