Define timestamp ordering, Database Management System

Assignment Help:

Define Timestamp ordering

Ans In timestamp-based method, a serial order is made among the concurrent transaction by assigning to every transaction a unique nondecreasing number. The common value assigned to each transaction is the system clock value at the beginning of the transaction, therefore the name timestamp ordering. This value then can be employed in deciding the order in which the conflict between two transactions is resolved. A transaction along with a smaller timestamp value is considered to be an "older" transaction as compared to another transaction with a larger timestamp value.


Related Discussions:- Define timestamp ordering

Cartisian product, Explain the cartesian product in Database Management Sys...

Explain the cartesian product in Database Management System

What are the reasons for having variable length records, What are the reaso...

What are the reasons for having variable length records? What are the various ways to store variable length records? Variable-length records arise in a database in various wa

What are the categories of sql command, What are the categories of SQL comm...

What are the categories of SQL command? SQL commands are separated in to the following categories: 1. Data - Definitition Language 2. Data Manipulation language 3. Dat

What are the factors into account when choosing a raid level, What are the ...

What are the factors to be taken into account when choosing a RAID level? A) Monetary cost of extra disk storage requirements. B) Performance requirements in terms of number

What are the disadvantages of file processing system, What are the disadvan...

What are the disadvantages of file processing system? The drawbacks of file processing systems are a) Data redundancy and inconsistency b) Complexity in accessing data

Query evolution, what is query processing ,query optimization and performan...

what is query processing ,query optimization and performance turring?

What is a query tree, What is a query tree?     Ans:  A query tree, as ...

What is a query tree?     Ans:  A query tree, as well known as operator graph, is a tree data structure that corresponds to a relational algebra expression. It denotes the inpu

Define shadow paging, Define shadow paging. An alternative to log-based...

Define shadow paging. An alternative to log-based crash recovery method is shadow paging. This technique requires fewer disk accesses than do the log-based methods.

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