Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Timestamp-based concurrency control

Known as: Timestamp ordering 
In computer science, a timestamp-based concurrency control algorithm is a non-lock concurrency control method. It is used in some databases to safely… Expand
Wikipedia

Related topics

Related topics

12 relations
Commitment orderingComputer scienceConcurrency controlDatabase
Expand

Broader (1)

Transaction processing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
An Advanced Approach of Local Counter Synchronization to Timestamp Ordering Algorithm in Distributed Concurrency Control
Concurrency control is the problem that database management system (DBMS) meets with difficulties, especially distributed DBMS… Expand
  • figure 1
  • figure 2
Is this relevant?
2013
2013
A Fast Implementation of Parallel Discrete-Event Simulation on GPGPU
Modern General Purpose Graphics Processing Units(GPGPUs) offer much more computational power than recent CPUs by providing a vast… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 6
  • figure 8
Is this relevant?
2002
2002
On Transaction Processing with Partial Validation and Timestamp Ordering in Mobile Broadcast Environments
Conventional concurrency control protocols are inapplicable in mobile broadcast environments due to a number of constraints of… Expand
  • figure 1
  • figure 1
  • figure 2
  • table 1
  • figure 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Timestamp snooping: an approach for extending SMPs
Symmetric muultiprocessor (SMP) servers provide superior performance for the commercial workloads that dominate the Internet. Our… Expand
Is this relevant?
1993
1993
A timestamp-based concurrency control algorithm for heterogeneous distributed databases
A heterogeneous distributed database system (HDDS) integrates existing database systems to support global transactions which… Expand
  • figure 2
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Divergence control for epsilon-serializability
The authors present divergence control methods for epsilon-serializability (ESR) in centralized databases. ESR alleviates the… Expand
Is this relevant?
Highly Cited
1989
Highly Cited
1989
A dynamic information-structure mutual exclusion algorithm for distributed systems
  • Mukesh Singhal
  • [] Proceedings. The 9th International Conference…
  • 1989
    • Corpus ID: 12591543
A dynamic information-structure mutual-exclusion algorithm is presented for distributed systems whose information structure… Expand
  • figure 1
  • table I
Is this relevant?
1988
1988
A Theory of Timestamp-Based Concurrency Control for Nested Transactions
We present a rigorous framework for analyzing timestampbased concurrency control and recovery algorithms for nested transactions… Expand
Is this relevant?
1987
1987
Performance results on multiversion timestamp concurrency control with predeclared writesets
In the Basic Timestamp Ordering protocol (BTO), as described in [BERN811 for example, each transaction T is assigned a unique… Expand
  • table 1
  • table 2
  • table 3
Is this relevant?
1987
1987
Performance Models of Timestamp-Ordering Concurrency Control Algorithms in Distributed Databases
A distributed database (DDB) consists of copies of data files (usually redundant) geographically distributed and managed on a… Expand
  • figure 1
  • figure 3
  • figure 5
  • figure 8
  • figure 9
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE