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

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

What are the disadvantages of file-processing system?  Ans: The Disadvantages of File-Processing System a. Data redundancy and inconsistency - Data redundancy means not nece

Define various ways in which select statement, Define various ways in which...

Define various ways in which SELECT statement can be used for record selection Technology?  SELECT gives you control over a number of aspects for record retrieval: 1) Which

Explain degree of relation, Explain degree of relation? Degree of a Re...

Explain degree of relation? Degree of a Relation - The degree or arity of a relation is the number of attributes n of its relation schema.

Define multivalued dependency and 4nf, Define multivalued dependency and 4N...

Define multivalued dependency and 4NF.  Ans:  Multivalued Dependency - Assume R be a relation schema and let α ⊆ R and β ⊆ R. The multivalued dependency  α →→β   holds o

What is completeness constraint on generalization, What is completeness con...

What is completeness constraint on generalization? Define the variation between total and partial design constraint. Give an example each.       Ans: Completeness Constraints

Compute the closure set, Compute the closure (F+) for the following set of ...

Compute the closure (F+) for the following set of the functional dependencies defined on R(a,b,c,d), where F - {c→ a, ab → d, a → b, d → c}, i.e. what are all of the FDs implied b

Explain dml with some examples, Explain DML with some examples? DML - D...

Explain DML with some examples? DML - Data Manipulation Language: statements used for managing data within schema objects. Some examples: • SELECT - retrieve data from the a da

Give short note on the following terms- dirty pages and etl, Give short not...

Give short note on the following terms:Dirty pages and ETL a.) Dirty pages. These are buffer pages which comprise modifications which haven't been written to disk. b.

Define query optimization, Define query optimization. Query optimizatio...

Define query optimization. Query optimization refers to the process of search the lowest -cost method of evaluating a given query.

Define the five basic operators of relational algebra, Define the five basi...

Define the five basic operators of relational algebra? Five basic operators of relational algebra are: 1. Union (∪∪∪∪) - Selects tuples which are in either P or Q or in both

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