Serializability

Known as: Conflict serializability, Distributed serializability, View serializability 
In concurrency control of databases, transaction processing (transaction management), and various transactional applications (e.g., transactional… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Currently, users of geo-distributed storage systems face a hard choice between having serializable transactions with high latency… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Many popular database management systems implement a multiversion concurrency control algorithm called snapshot isolation rather… (More)
  • figure 2
  • figure 3
  • figure 9
  • figure 11
  • figure 10
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Previously we presented atomic sets, memory locations that share some consistency property, and units of work, code fragments… (More)
  • figure 1
  • figure 2
  • figure 5
  • table 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We aim to improve reliability of multithreaded programs by proposing a dynamic detector that detects potentially erroneous… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Snapshot Isolation (SI) is a multiversion concurrency control algorithm, first described in Berenson et al. [1995]. SI is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Epsilon Serializability ESR is a generalization of classic serializability SR ESR allows some limited amount of inconsistency in… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
In this paper, we introduce Quasi Serializability, a correctness criterion for concurrency control in heterogeneous distributed… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1988
Highly Cited
1988
In the classical approach to transaction processing, a concurrent execution is considered to be correct if it is equivalent to a… (More)
Is this relevant?
Highly Cited
1979
Highly Cited
1979
A sequence of interleaved user transactions in a database system may not be ser:ahzable, t e, equivalent to some sequential… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
Highly Cited
1979
Highly Cited
1979
An arbitrary interleaved execution of transactions in a database system can lead to an inconsistent database state. A number of… (More)
  • figure 2
  • figure 5
  • figure 6
  • figure 7
  • figure 8
Is this relevant?