Results 141 to 150 of about 4,695 (158)

Static serializability analysis for causal consistency

ACM SIGPLAN Notices, 2018
Many distributed databases provide only weak consistency guarantees to reduce synchronization overhead and remain available under network partitions. However, this leads to behaviors not possible under stronger guarantees. Such behaviors can easily defy programmer intuition and lead to errors that are notoriously hard to detect. In this paper,
Martin Vechev, Peter Müller, Lucas Brutschy, Dimitar Dimitrov   +3 more
openaire   +3 more sources

The complexity of strict serializability revisited

Information Processing Letters, 1987
A well known result by \textit{R. Sethi} [J. Assoc. Comput. Mach. 29, 394- 403 (1982; Zbl 0478.68098)], states that strict view- and final-state serializability are NP-complete in general, but decidable in polynomial time if useless values are absent.
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   +2 more sources

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.
Burkhard Freitag, Carl-Alexander Wichert, Alfred Fent   +2 more
openaire   +2 more sources

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
Philip S. Yu, Calton Pu, Kun-Lung Wu
openaire   +2 more sources

Serializability of nested transactions in multidatabases

1997
The correctness of nested transactions for multidatabases differs from that of flat transactions in that, for nested transactions the execution order of siblings at each related site should also be consistent. In this paper we first propose a simple but powerful theory for the serializability of nested transactions in multidatabases and then a ...
Asuman Dogac, Budak Arpinar, Ugur Halici
openaire   +2 more sources

Consistency and Serializability in Concurrent Database Systems

SIAM Journal on Computing, 1984
Summary: The main results of this paper show that serialization is both necessary and sufficient for consistency in concurrent database systems. This is true for both the final database and the views of the database seen by individual transactions. The model of a transaction includes both read and write operations, which may be performed in any order ...
Richard Edwin Stearns, P. M. Lewis, Daniel J. Rosenkrantz   +2 more
openaire   +2 more sources

On Serializable Incremental Semantic Reasoners

Proceedings of the Knowledge Capture Conference, 2017
This short paper motivates the need for incremental and serializable semantic reasoners. Two possible scenarios where semantic reasoners with these feature could be interesting are outlined, namely reasoning on mobile devices and managing dynamic knowledge.
Eduardo Mena, Carlos Bobed, Jeff Z. Pan, Fernando Bobillo   +3 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.
Lalit M. Patnaik, Ramesh C. Hansdah
openaire   +2 more sources

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