Results 91 to 100 of about 2,812 (135)

ON SERIALIZABLE LANGUAGES

International Journal of Foundations of Computer Science, 1994
Cai and Furst introduced the notion of bottleneck Turing machines. Based on Barrington’s innovating technique, which is used to showed that polynomial-size branching programs have exactly the same power as NC1, Cai and Furst showed that the languages recognized by width-5 bottleneck Turing machines are exactly the same as those in PSPACE.
openaire   +2 more sources

Serializability with constraints

ACM Transactions on Database Systems, 1987
This paper deals with the serializability theory for single-version and multiversion database systems. We first introduce the concept of disjoint-interval topological sort ( DITS , for short) of an arc-labeled directed acyclic graph.
Toshihide Ibaraki, Tiko Kameda, Toshimi Minoura   +2 more
openaire   +1 more source

Relative serializability (extended abstract)

Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '94, 1994
In the presence of semantic information, serializability is too strong a correctness criterion and unnecessarily restricts concurrency. We use the semantic information of a transaction to provide different atomicity views of the transaction to other transactions.
D. Agrawal, J. L. Bruno, A. El Abbadi, V. Krishnaswamy   +3 more
openaire   +1 more source

Conditional Conflict Serializability

Journal of Database Management, 1998
Serializability is too strict a correctness criterion for several application domains, in particular where support for long-lasting transactions is required. This paper describes a generalized version of serializability called conditional conflict serializability (CCSR), which is built on a customized notion of conflict rather than the standard ...
openaire   +1 more source

On serializability of iterated transactions

Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '82, 1982
In the literature on serializability (see [1]), a transaction is considered to be a finite sequence of operations. As a step towards the handling of more complex evolutions of processes, we assume in this paper that the sequence of operations performed by a transaction may be infinitely often repeated as for instance, might behave a pre-existing ...
M. P. Fle, G. Roucairol
openaire   +1 more source

Optimal Deployment of Eventually-Serializable Data Services

Annals of Operations Research, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michel, L., Shvartsman, A., Sonderegger, E., Van Hentenryck, P.   +3 more
openaire   +2 more sources

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