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 the two constraints check and foreign key in sql, Explain the two c...

Explain the two constraints, check and foreign key in SQL along with an example for each. Give the syntax. CHECK constraint - CHECK constraint specifies an expression which

Database part of ldb?, Is it mandatory to declare all the tables in Report ...

Is it mandatory to declare all the tables in Report by the key word tables for all the tables that exist in the structure of LDB, and are being explained in the Database part of LD

What is the candidate key for a table with columns, For problems 1-4, give ...

For problems 1-4, give all candidate keys for the tables with FDs specified.  Composite candidate keys must be put in parentheses, and candidate keys must be separated with commas

What is secondary index, What is Secondary Index While making the index...

What is Secondary Index While making the index, generally the index table is kept in the primary memory (RAM) and the main table, because of its size is keeps in the secondary

Describe the benefits of OOD techniques, Describe the benefits of OOD techn...

Describe the benefits of OOD techniques OOD techniques are very useful for development of large and complex systems. It has been noted that large projects that are developed u

Two approaches to store relations in distributed database, What are the two...

What are the two approaches to store relations in distributed database? a) Replication b) Fragmentation

Weak entity, Entity types that do not have any key attribute, and therefore...

Entity types that do not have any key attribute, and therefore cannot be identified independently, are known as weak entity types. A weak entity can be recognized uniquely only by

State about the tables- DBMS, State about the Tables- DBMS Data is sto...

State about the Tables- DBMS Data is stored in columns and rows (much like a spreadsheet -main difference is how data is organised). Every row in a table is known as a record

Improve efficiency in query evaluation, Question: AirwaysCentre, an int...

Question: AirwaysCentre, an international airline booking company currently uses a relational database system for their operations, which includes the following relations: P

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