This Article 
 Bibliographic References 
 Add to: 
On rigorous Transaction Scheduling
September 1991 (vol. 17 no. 9)
pp. 954-960

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.

[1] R. Alonso, H. Garcia-Molina, and K. Salem, "Concurrency control and recovery for global procedures in federated database systems,"A Quart. Bull. Computer Society IEEE Technical Committee on Data Eng., vol. 10, Sept. 1987.
[2] P. Bernstein and N. Goodman, "Concurrency Control in Distributed Database Systems,"ACM Computing Surveys, Vol. 13, No. 2, June 1981, pp. 185-221.
[3] P.A. Bernstein, V. Hadzilacos, and N. Goodman,Concurrency Control and Recovery in Database Systems, Addison-Wesley, Reading, Mass., 1987.
[4] Y. Breitbart and A. Silberschatz, "Multidatabase update issues," inProc. ACM SIGMOD Int. Conf. Management of Data, June 1988.
[5] Y. Breitbart, A. Silberschatz, and G. Thompson, "An update mechanism for multidatabase systems,"A Quart. Bull. Computer Society IEEE Technical Committee on Data Eng., vol. 10, no. 3, Sept. 1987.
[6] W. Du, A. Elmagarmid, Y. Leu, and S. Osterman, "Effects of autonomy on maintaining global serializability in heterogeneous distributed data-base systems," inProc. 2nd Int. Conf. on Data and Knowledge Systems for Manufacturing and Engineering, Oct. 1989.
[7] W. Du and A.K. Elmagarmid, "Quasi Serializability: A Correctness Criterion for Global Concurrency Control in InterBase,"Proc. 15th Int'l Conf. Very Large Databases, Morgan Kaufmann Publishers, Palo Alto, Calif., 1989, pp. 347-355.
[8] K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger, "The notions of consistency and predicate locks in a database system,"Commun. ACM, vol. 19, no. 11, pp. 624-633, Nov. 1976.
[9] A. Elmagarmid and A. Helal, "Supporting Updates in Heterogeneous Distributed Database Systems,"Proc. Fourth Int'l Conf. Data Engineering, CS Press, Los Alamitos, Calif., Order No. 827, 1988, pp. 564-571.
[10] V. D. Gligor and R. Popescu-Zeletin, "Concurrency control issues in distributed heterogeneous database management systems," inDistributed Data Sharing Systems, F. A. Schreber and W. Litwin, Eds. Amsterdam: North-Holland, 1985.
[11] D. Georgakopoulos and M. Rusinkiewicz, "Transaction management in multidatabase systems," Dept. Computer Sci., Univ. Houston, Houston, TX, Tech. Rep. UH-CS-89-20, Sept. 1989.
[12] T. Hadzilacos and M. Yannakakis, "Deleting completed transactions," inProc. 5th ACM-SIGACT-SIGMOD Symp. Principles of Database Syst., 1986.
[13] H. T. Kung and J. T. Robinson, "On optimistic methods for concurrency control,"ACM Trans. Database Syst., vol. 6, pp. 213-226, June 1981.
[14] Y. Leu, A. K. Elmagarmid, and D. N. Mannai, "A transaction management facility for interbase," Comput. Eng. Program, Pennsylvania State Univ., Tech. Rep. TR-88-064, 1988.
[15] W. Litwin, "From database systems to multidatabase systems: why and how," inBritish National Conference on Databases. Cambridge, UK: Cambridge Univ. Press, 1988
[16] A. Wolski and J. Veijalainen, "2PC Agent Method: Achieving Serializability in Presence of Failures in a Heterogeneous Multidatabase,"Proc. Int'l Conf. Databases, Parallel Architectures, and their Applications, IEEE Press, Piscataway, N.J., p. 321.

Index Terms:
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
Y. Breitbart, D. Georgakopoulos, M. Rusinkiewicz, A. Silberschatz, "On rigorous Transaction Scheduling," IEEE Transactions on Software Engineering, vol. 17, no. 9, pp. 954-960, Sept. 1991, doi:10.1109/32.92915
Usage of this product signifies your acceptance of the Terms of Use.