Results 101 to 110 of about 2,812 (135)

Strictness and serializability

1986
In the theory of concurrency control several notions of the correctness of logs have been developed, particularly final-state-, view-, and conflict-preserving-serializability. SR, VSR, and CPSR are the respective sets of logs. In each case a strict variant can be defined. The respective sets are SSR, SVSR, and SCPSR.
openaire   +1 more source

Correctness Criteria Beyond Serializability

2009
A transaction is a logical unit of work that includes one or more database access operations such as insertion, deletion, modification, and retrieval [8]. A schedule (or history) S of n transactions T1,.,Tn is an ordering of the transactions that satisfies the following two conditions: (i) the operations of Ti (i = 1,.,n) in S must occur in the same ...
Ouzzani, Mourad, Medjahed, Brahim, Elmagarmid, Ahmed   +2 more
openaire   +2 more sources

Update serializability in locking

1986
There are many concurrency control algorithms that use weak consistency of read-only transactions to enhance concurrency in database systems[3,8,18]. We identify these schedules (which become serializable when the weakly consistent read-only transactions are deleted from them) as update serializable schedules.
R. C. Hansdah, L. M. Patnaik
openaire   +1 more source

When serializability comes without cost

2008 IEEE/ACS International Conference on Computer Systems and Applications, 2008
It is usually expected that performance is reduced by using stricter concurrency control, which reduces the risk of anomalies that can lead to data corruption. For example, the weak isolation level Read Committed allows anomalies that are prevented by two-phase locking (abbreviated 2PL), and because 2PL holds locks for longer than RC, it has lower ...
Mohammad Alomari, Michael Cahill, Alan Fekete, Uwe Rohm   +3 more
openaire   +1 more source

Autonomous transaction execution with epsilon serializability

[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing, 2003
The authors study the feasibility of autonomous transaction execution in systems with asynchronous transaction processing based on epsilon serializability (ESR). The abstract correctness criteria defined by ESR are implemented by techniques such as asynchronous divergence control and asynchronous consistency restoration.
C. Pu, A. Leff
openaire   +1 more source

Serializability Preserving Extensions of Concurrency Control Protocols

2000
The verification system PVS is used to obtain mechanized support for the formal specification and verification of concurrency control protocols, concentrating on database applications. A method to verify conflict serializability has been formulated in PVS and proved to be sound and complete with the interactive proof checker of this tool.
Chkliaev, D., Hooman, J.J.M., Stok, P. van der   +2 more
openaire   +3 more sources

Efficiently Supporting Multi-Level Serializability in Decentralized Database Systems

IEEE Transactions on Knowledge and Data Engineering, 2023
Zhanhao Zhao, Wei Lu, Meihui Zhang
exaly  

serializable, adj.

2023
openaire   +1 more source

Serializability

2009
openaire   +1 more source

Serializability

2017
openaire   +1 more source