Results 121 to 130 of about 2,261 (145)

Generalized theory of serializability

Acta Informatica, 1987
An interleaved execution of transactions in a database system is serializable if the effect of the execution is equivalent to that of some serial execution of the transactions. Several notions of serializability have been defined in the literature.
openaire   +2 more sources

Making Consistency Protocols Serializable

Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019
A tutorial given at PODS 2019, focussed on several research agendas in the past decade or so, that examine weak isolation levels, and obtain many (or all) of the benefits for application integrity, traditionally achieved by serializable concurrency control. The tutorial presents both the mechanisms and the reasoning approaches from these research works.
openaire   +1 more source

Logical transactions and serializability

1998
The concept of logic databases can serve as a clear and expressive foundation of various kinds of information systems. However, classical logic languages refer to a single database state, whereas in modern information systems it is necessary to take dynamic behaviour into account.
Carl-Alexander Wichert, Burkhard Freitag, Alfred Fent   +2 more
openaire   +1 more source

Divergence control for epsilon-serializability

[1992] Eighth International Conference on Data Engineering, 2003
The authors present divergence control methods for epsilon-serializability (ESR) in centralized databases. ESR alleviates the strictness of serializability (SR) in transaction processing by allowing for limited inconsistency. The bounded inconsistency is automatically maintained by divergence control (DC) methods in a way similar to the manner in which
null Kun-Lung Wu, P.S. Yu, C. Pu
openaire   +1 more source

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

Serializability by commitment ordering

Information Processing Letters, 1994
Abstract A new serializability concept, Commitment Ordering (CO), allows to effectively achieve global serializability across multiple autonomous Database Systems, that may use different (any) concurrency control mechanisms. CO generalizes the popular Strong-Strict Two Phase Locking (S-S2PL) concept.
openaire   +2 more sources

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