Results 111 to 120 of about 2,261 (145)
Some of the next articles are maybe not open access.
Performance Evaluation, 1985
Concurrent execution of database transactions is desirable from the point of view of speed, but may introduce inconsistencies. A commonly used criterion of correctness of a concurrent execution of transactions is serializability, i.e., the equivalence of the execution to some serial schedule or schedules.
Brzozowski, J. A., Muro, S.
openaire +1 more source
Concurrent execution of database transactions is desirable from the point of view of speed, but may introduce inconsistencies. A commonly used criterion of correctness of a concurrent execution of transactions is serializability, i.e., the equivalence of the execution to some serial schedule or schedules.
Brzozowski, J. A., Muro, S.
openaire +1 more source
Serializable eventual consistency
Proceedings of the 2nd Workshop on the Principles and Practice of Consistency for Distributed Data, 2016In order to allow offline functionality of (mobile) web applications, state needs to be optimistically replicated and synchronized whenever connection is re-established. We present a programming language solution that provides replicated application state in a cloud-client setting.
Tim Coppieters +2 more
openaire +1 more source
Journal of the ACM, 1984
The power of locking as a primitive for controlling concurrency in database systems is examined. It is accepted that the concurrent execution (or schedule) of different transactions must be serializable; that is, it must behave like a serial schedule, one in which the transactions run one at a time.
openaire +1 more source
The power of locking as a primitive for controlling concurrency in database systems is examined. It is accepted that the concurrent execution (or schedule) of different transactions must be serializable; that is, it must behave like a serial schedule, one in which the transactions run one at a time.
openaire +1 more source
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
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, 1987This 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 +2 more
openaire +1 more source
Sequential verification of serializability
ACM SIGPLAN Notices, 2010Serializability is a commonly used correctness condition in concurrent programming. When a concurrent module is serializable, certain other properties of the module can be verified by considering only its sequential executions. In many cases, concurrent modules guarantee serializability by using standard locking protocols, such as tree locking or two ...
H. Attiya, G. Ramalingam, N. Rinetzky
openaire +1 more source
Relative serializability (extended abstract)
Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '94, 1994In 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 +3 more
openaire +1 more source
Conditional Conflict Serializability
Journal of Database Management, 1998Serializability 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, 1982In 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, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michel, L. +3 more
openaire +2 more sources