Issue No. 09 - September (1991 vol. 17)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.92915
<p>The class of transaction scheduling mechanisms in which the transaction serialization order can be determined by controlling their commitment order, is defined. This class of transaction management mechanisms is important, because it simplifies transaction management in a multidatabase system environment. The notion of analogous execution and serialization orders of transactions is defined and the concept of strongly recoverable and rigorous execution schedules is introduced. It is then proven that rigorous schedulers always produce analogous execution and serialization orders. It is shown that the systems using the rigorous scheduling can be naturally incorporated in hierarchical transaction management mechanisms. It is proven that several previously proposed multidatabase transaction management mechanisms guarantee global serializability only if all participating databases systems produce rigorous schedules.</p>
rigorous transaction scheduling; transaction scheduling mechanisms; transaction serialization order; commitment order; multidatabase system environment; analogous execution; serialization orders; rigorous schedulers; hierarchical transaction management mechanisms; global serializability; concurrency control; database theory; distributed databases; scheduling; transaction processing
D. Georgakopoulos, Y. Breitbart, A. Silberschatz and M. Rusinkiewicz, "On rigorous Transaction Scheduling," in IEEE Transactions on Software Engineering, vol. 17, no. , pp. 954-960, 1991.