Concurrent execution of database transactions i desirable from the point of view of speed, but may introduce inconsistencies. A commonly used criterion of correctness of a concurrent execution of transactions i serializability, i.e., the equivalence of the execution to some serial schedule or schedules. In the literature several transaction models have been used and several different notions of serializability have been introduced. In this paper, we investigate the various serializability families in the general transaction model, in the two-step model, and in the restricted two-step model. We also examine these families in the multiversion database model
Serializability is usually defined operationally in terms of sequences of operations. This paper gi...
AbstractThe serializability condition is usually considered in order to maintain the consistency of ...
AbstractMultiversion schedulers are now a widely accepted method for enhancing the performance of th...
The usual correctness condition for a schedule of concurrent database transactions is some form of s...
AbstractThe serializability condition is usually considered in order to maintain the consistency of ...
A transaction is a logical unit of work that includes one or more database access operations such as...
Concurrency control protocols based on multiversions have been used in some commercial transaction p...
Marked databases are a generalization of relational databases in which there are no fixed schemas, a...
AbstractIn a number of application environments (e.g., computer aided design),serializability, the t...
AbstractIn a multidatabase system, global transactions are executed under the control of the global ...
Motivated by shortcomings of classical serializability as a correct criterion in recent transaction-...
In conventional systems, transaction management has been thoroughly investigated and is now conside...
AbstractIn this paper we study the serializability and the concurrent access to a database by making...
This thesis examines approaches to the preservation of multidatabase consistency through concurrency...
Concurrency control in multidatabase (i.e. heterogeneous, distributed database) systems is a topic o...
Serializability is usually defined operationally in terms of sequences of operations. This paper gi...
AbstractThe serializability condition is usually considered in order to maintain the consistency of ...
AbstractMultiversion schedulers are now a widely accepted method for enhancing the performance of th...
The usual correctness condition for a schedule of concurrent database transactions is some form of s...
AbstractThe serializability condition is usually considered in order to maintain the consistency of ...
A transaction is a logical unit of work that includes one or more database access operations such as...
Concurrency control protocols based on multiversions have been used in some commercial transaction p...
Marked databases are a generalization of relational databases in which there are no fixed schemas, a...
AbstractIn a number of application environments (e.g., computer aided design),serializability, the t...
AbstractIn a multidatabase system, global transactions are executed under the control of the global ...
Motivated by shortcomings of classical serializability as a correct criterion in recent transaction-...
In conventional systems, transaction management has been thoroughly investigated and is now conside...
AbstractIn this paper we study the serializability and the concurrent access to a database by making...
This thesis examines approaches to the preservation of multidatabase consistency through concurrency...
Concurrency control in multidatabase (i.e. heterogeneous, distributed database) systems is a topic o...
Serializability is usually defined operationally in terms of sequences of operations. This paper gi...
AbstractThe serializability condition is usually considered in order to maintain the consistency of ...
AbstractMultiversion schedulers are now a widely accepted method for enhancing the performance of th...