Results 131 to 140 of about 4,695 (158)
Some of the next articles are maybe not open access.
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 ...
G. Roucairol, M. P. Fle
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.
Tiko Kameda +2 more
openaire +2 more sources
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 +2 more sources
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 +2 more sources
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 +3 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 +3 more sources
On the serializability theorem for nested transactions [PDF]
Information Processing Letters, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. El Abbadi, Rodolfo F. Resende
openaire +2 more sources
Integrity aspects of quasi serializability
Information Processing Letters, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahmed K. Elmagarmid, Weimin Du
openaire +2 more sources
On the Correctness Problem for Serializability
2021Concurrent correctness conditions formalize the notion of “seeming atomicity” in concurrent access to shared object state. For different sorts of objects (databases, concurrent data structures, software transactional memory) different sorts of correctness conditions have been proposed (serializability, linearizability, opacity).
Heike Wehrheim, Jürgen König
openaire +2 more sources
Generalized theory of serializability
Acta Informatica, 1987An 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 +3 more sources
Autonomous transaction execution with epsilon serializability
[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing, 2003The 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.
Calton Pu, Avraham Leff
openaire +2 more sources
Serializability by commitment ordering
Information Processing Letters, 1994Abstract 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 +3 more sources