Explain the timestamp ordering protocol, Database Management System

Timestamp Ordering Protocol

A timestamp is a tag that can be attached to any transaction or any data item, which indicates a specific time on which the transaction or data item had been activated in any way. We, who use computers, must all be familiar with the methods of "Date Created" or "Last Modified" properties of files and folders. Well, timestamps are things like that.

A timestamp can be executed in two ways. The simplest one is to directly assign the current value of the clock to the transaction or the data item. The other policy is to attach the value of a logical counter that keeps incrementing as new timestamps are needed.

The timestamp of a transaction shows the time when it was first activated. The timestamp of a data item can be of the following two types:

W-timestamp (Q): This means the latest time when the data item Q has been written into.

R-timestamp (Q): This means the latest time when the data item Q has been read from.

 

Posted Date: 7/26/2013 7:15:12 AM | Location : United States







Related Discussions:- Explain the timestamp ordering protocol, Assignment Help, Ask Question on Explain the timestamp ordering protocol, Get Answer, Expert's Help, Explain the timestamp ordering protocol Discussions

Write discussion on Explain the timestamp ordering protocol
Your posts are moderated
Related Questions
Differentiate between a unique key and a primary key. - By default, clustered index on column are created by primary key while nonclustered index are created by unique key.

what is query processing ,query optimization and performance turring?

How to use Oracle

What is the meaning of Data independence? Data independence means a programs that are not dependent on the physical attributes of data and a programs that are not dependent on

What is authorization graph? Passing of authorization from single user to another can be shown by an authorization graph.

Explain the concept of generalization and aggregation in E_R diagrams. Give one example for each one of them? Generalization: Consider extending the entity set account throug

what is difference between circular inked lust and grunded linked list

We will explain here an example database application having COLLEGE database and use it in showing several E-R modelling concepts. College database remains track of faculty, Stu

Question: In a multi-user database environment, locking mechanisms can be used to solve the three basic problems of concurrency. On the other hand, however, locking may also le

Define What are the desirable properties of a decomposition Ans: What are the desirable properties of decomposition - dependency preserving.  Because Lossless join and dependen