Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,321 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Commitment ordering
Computer science
Concurrency control
Database
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
Loc X. Nguyen
2015
Corpus ID: 61213710
Concurrency control is the problem that database management system (DBMS) meets with difficulties, especially distributed DBMS…
Expand
2013
2013
A Fast Implementation of Parallel Discrete-Event Simulation on GPGPU
Janche Sang
,
Che-Rung Lee
,
V. Rego
,
C. King
2013
Corpus ID: 9757910
Modern General Purpose Graphics Processing Units(GPGPUs) offer much more computational power than recent CPUs by providing a vast…
Expand
2009
2009
An energy-efficient mobile transaction processing method using random back-off in wireless broadcast environments
Sunggeun Park
,
Sungwon Jung
Journal of Systems and Software
2009
Corpus ID: 15437178
2004
2004
Efficient validation of mobile transactions in wireless environments
V. Lee
,
K. Lam
,
Tei-Wei Kuo
Journal of Systems and Software
2004
Corpus ID: 7578864
2000
2000
Timestamp snooping: an approach for extending SMPs
Milo M. K. Martin
,
Daniel J. Sorin
,
+7 authors
D. Wood
International Conference on Architectural Support…
2000
Corpus ID: 53224608
Symmetric muultiprocessor (SMP) servers provide superior performance for the commercial workloads that dominate the Internet. Our…
Expand
1999
1999
On Interactions Between Coexisting Traditional and Cooperative Transactions
Yanchun Zhang
,
Y. Kambayashi
,
X. Jia
,
Yun Yang
,
Chengzheng Sun
International Journal of Cooperative Information…
1999
Corpus ID: 31172928
In order to support the interaction betweeen coexisting traditional short transactions and long cooperative transactions, we…
Expand
1999
1999
Providing Transactional Properties for Migrating Workflows
A. Cichocki
,
M. Rusinkiewicz
Proceedings. Tenth International Workshop on…
1999
Corpus ID: 8919212
Current workflow management systems have several limitations that need to be addressed by the research community. This paper…
Expand
1993
1993
A timestamp-based concurrency control algorithm for heterogeneous distributed databases
S. M. Chung
,
Khalid A. Elghayesh
International Conference on Computing and…
1993
Corpus ID: 40755298
A heterogeneous distributed database system (HDDS) integrates existing database systems to support global transactions which…
Expand
1993
1993
Performance characteristics of epsilon serializability with hierarchical inconsistency bounds
M. Kamath
,
K. Ramamritham
Proceedings of IEEE 9th International Conference…
1993
Corpus ID: 14015076
The notion of hierarchical inconsistency bounds that allows inconsistency to be specified at different granularities-with…
Expand
1993
1993
A Protocol for Consistent Checkpointing Recovery for Time-Critical Distributed Database Systems
Junguk L. Kim
,
T. Park
,
P. Swarnam
,
M.-J. Kim
International Conference on Database Systems for…
1993
Corpus ID: 1002804
This paper presents a checkpointing scheme which effectively copes with media failures for a distributed database system (DDBS…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE