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

Database design, Build a database application for a sports league. Assume y...

Build a database application for a sports league. Assume your application is to keep track of teams and equipment that is checked out to teams. Explain the steps that is needed and

Durability-transaction , Durability : This property necessitates that once ...

Durability : This property necessitates that once a transaction has committed, the changes made by it be never lost because of subsequent failure. Thus, a transaction is also a bas

Eliminate repeating groups, Eliminate Repeating Groups The problem is, ...

Eliminate Repeating Groups The problem is, "Find out the list of employees, who knows DB2". For this problem we require to perform an awkward scan of the list looking for re

Data models, why older data models are being replaced by new data models....

why older data models are being replaced by new data models.

Explain the b+ tree, Explain the B + tree? B + tree is a type of tre...

Explain the B + tree? B + tree is a type of tree which denotes sorted data in a way that permits for efficient insertion, retrieval and removal of records, each of which is

Define the basic operations of the relational algebra, Define the basic ope...

Define the basic operations of the relational algebra?     Ans: Basic operators of relational algebra are: 1. Union (∪) - Selects tuples which are in either P or Q or in bot

What is a recursive relationship, Question: (a) Can a set of data requi...

Question: (a) Can a set of data requirements be correctly modelled by two or more different ER diagrams? Explain your answer. You may use a small example, if you think it will

Define single valued and multivalued attributes, Define single valued and m...

Define single valued and multivalued attributes.  Single valued attributes: attributes with a single value for a particular entity are known as single valued attributes.   M

Define join and outer join, Define Join and Outer Join and differentiate be...

Define Join and Outer Join and differentiate between them.      Ans: Join - It generates all the combinations of tuples from two relations which satisfy a join condition.  Oute

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