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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1982-2017
02419822017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
With the fundamental change of hardware technology, main-memory database systems have emerged as the next generation of DBMS… (More)
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
2010
2010
Various concurrency control algorithms have been proposed for use in distributed database systems. Even, the large number of… (More)
  • figure 1
  • figure 3
Is this relevant?
2006
2006
A concept of role is widely and significantly used to design and implement secure information systems. A role shows a job… (More)
Is this relevant?
2005
2005
A role-based access control model is used to make a system secure. A role concept shows a job function in an enterprise… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1991
1991
A simulation model of a distributed database system is defined; it is then used to analyze the behavior of various concurrency… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
1989
1989
While several distributed (or 'shared nothing') database machines exist in the form of prototypes or commercial products, and a… (More)
  • figure 1
  • table 2
  • table 3
  • table 4
  • figure 6
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Many concurrency control algorithms have been proposed for use in distributed database systems. Despite the large number of… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
1987
1987
Concurrency control algorithms have traditionally been based on locking and timestamp ordering mechanisms. Recently optimistic… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
1987
1987
In the Basic Timestamp Ordering protocol (BTO), as described in [BERN811 for example, each transaction T is assigned a unique… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
1986
1986
We propose multidimensional timestamp protocols for concurrency control in database systems where each transaction is assigned a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?