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

Define the schema at the intermediate level of abstraction, Define Accordin...

Define According to the levels of abstraction, the schema at the intermediate level is called  Ans: As per to the levels of abstraction, the schema at the intermediate level is

Define aggregate functions, Define Aggregate functions and what aggregate f...

Define Aggregate functions and what aggregate functions supported by the MySQL To calculate a summary value from a set of individual values and uses one of the functions known

What are the two integrity rules, What are the two integrity rules?  An...

What are the two integrity rules?  Ans:  The two integrity rules are: Entity Integrity Rule & Referential Integrity Rule.   Entity Integrity Rule - If the attribute A of rel

Isolation or independence-transaction , Isolation or Independence : The iso...

Isolation or Independence : The isolation property shows that the updates of a transaction should not be visible till they are committed. Isolation assurance that the progresses of

Special comparison operator used in where clause-dml, Special comparison op...

Special comparison operator used in where Clause a.   between. ...and...It gives range among two values (inclusive) Example: SELECT ENAME, SAL FROM EMP WHERE SAL BETWE

Define weak and strong entity sets, Define weak and strong entity sets?  ...

Define weak and strong entity sets?  Weak entity  set:  entity  set  that  do not  have  key  attribute  of  their  own are  known as weak entity sets.  Strong entity set

Determine the method of choosing algorithms, Determine the method of Choosi...

Determine the method of Choosing Algorithms In general, most of operations are easy and have a satisfactory algorithm since description of what is to be done also shows how i

Define the wait for graph, Define the Wait for graph Ans: The wait-for-...

Define the Wait for graph Ans: The wait-for-graph is a directed graph and consist of nodes and directed arcs; the nodes of the graph are active transactions. An arc of the grap

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