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

Explain recursive relationship type, Explain Recursive relationship type? ...

Explain Recursive relationship type? Recursive relationship type: A recursive relationship is one in that the similar entity participates more than once in the relationship

Explain data dictonary on oracle, Explain data dictonary on oracle ? Da...

Explain data dictonary on oracle ? Data Dictionary - Data dictionaries are the system tables in which contain descriptions of the database objects and how they are structured.

Define a view and a trigger, Define a view and a trigger. Construct a view ...

Define a view and a trigger. Construct a view for the above relations that have the information about suppliers and the elements they supply. The view holds the S#, SNAME, P# , PNA

How does the two phase protocol ensure serializability, How does the two ph...

How does the two phase protocol ensure serializability in database schedules?   Ans:  A transaction is termed to follow the two-phase locking protocol if all locking operations

What is known as a search key, What is known as a search key? An attrib...

What is known as a search key? An attribute or set of attributes used to look up records in a file is known as a search key.

What is equi join, What is equi join? Equi Join - It generates all th...

What is equi join? Equi Join - It generates all the combinations of tuples from two relations which satisfy a join condition along with only equality comparison (=).

Explain the timestamps for read operations, Timestamps For Read operations:...

Timestamps For Read operations: If TS (T) 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

Types of locks, Types of Locks There are two necessary types of locks: ...

Types of Locks There are two necessary types of locks: Binary lock : This locking mechanism has two states for to a data item: locked or unlocked Multiple-mode loc

Define a property that is not a property of transactions, Define a property...

Define a property that is not a property of transactions? Ans: Concurrency is not a property of transactions

What is hash file organization, What is hash file organization? What are t...

What is hash file organization? What are the causes of bucket overflow within a hash file organization? What can be completed to decrease the occurrence of bucket overflow?

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