Explain the timestamps for read operations, Database Management System

Assignment Help:

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).

 


Related Discussions:- Explain the timestamps for read operations

Describe hashing in dbms, Describe Hashing in DBMS? Hashing: Hashing ...

Describe Hashing in DBMS? Hashing: Hashing is a technique to store data within an array so which storing, searching, inserting and deleting data is fast (in theory it's O(1))

What is deadlock, What is deadlock? Neither of the transaction can ever...

What is deadlock? Neither of the transaction can ever proceed with its normal implementation. This situation is known as deadlock.

Explain transaction, What is transaction? Collections of operations tha...

What is transaction? Collections of operations that form a single logical unit of work are known as transactions.

Digital, #floating point representation is used to store

#floating point representation is used to store

Database, 3. (10 points) Assume that you have been presented with the follo...

3. (10 points) Assume that you have been presented with the following relation for the Baxter Aviation database: Charters (Pilot#, Pilot name, Aircraft ID#, #seats, Village, Fligh

What are the objectives of query processing, What are the objectives of que...

What are the objectives of query processing?       Ans: The objectives of query processing is to transform a query written in a high level language into a accurate and efficien

Transaction, what are the states of transaction?

what are the states of transaction?

Cartesian product, If R1 and R2 are two relations or functions, then the re...

If R1 and R2 are two relations or functions, then the result of R3 = R1 × R2 is the combination of tuples that are in R1 and R2. The product is associative and commutative. Degr

Define relations in tables and define primary keys, Consider the subsequent...

Consider the subsequent relations along with keys underlined Street (name, location, city) House (number, street_name) Lives (name, house_number) Define the above relations

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd