This Article 
 Bibliographic References 
 Add to: 
Databases with Deadline and Contingency Constraints
August 1995 (vol. 7 no. 4)
pp. 552-565

Abstract—Real-time database systems associate the concept of deadlines with transaction executions. Previous approaches use “best effort” techniques to schedule a given set of transactions to meet the deadlines as well as to ensure the consistency of the database. However, such approaches are inadequate for target applications which have “hard” real-time deadlines that need to be met in the event of crisis situations. In such cases, it is important to obtain contingency plans that may be invoked with guaranteed execution time characteristics. This paper presents an alternative model for real-time database systems in which deadlines are associated with “contingency” constraints rather than directly with transactions. Our approach leads to a predicate-based model that intrinsically incorporates both triggering and relative timing constraints regarding the transaction executions. We exhibit that selecting contingency plans with respect to various optimality criteria has inherent computational inefficiencies. We study the issues in scheduling of the selected plans with the focus on the contention among the transactions for data resources. Our results exhibit that the data contention, by itself, has a severe adverse impact on the schedulability of the deadline-constrained transactions. We discuss some of the practical implications of our results, and we suggest some counter-measures to handle the computational complexities.

[1] K. Ramamritham,“Real-time databases,” Int’l J. Parallel and Distributed Databases, invited paper, 1992.
[2] M.H. Graham,“Issues in real-time data management,” J. Real-Time Systems, vol. 4, pp. 185-202, 1992.
[3] H.F. Korth, N. Soparkar, and A. Silberschatz, “Triggered Real Time Databases with Consistency Constraints,” Proc. 16th VLDB Conf., Aug. 1990.
[4] N.R. Soparkar,“Time-constrained transaction management,” PhD dissertation, Dept. of Computer Sciences,Univ. of Texas at Austin, Dec. 1993.
[5] K.-J. Lin,F. Jahanian,A. Jhingran,, and C.D. Locke,“A model of hard real-time transaction systems,” Technical Report RC No. 17515, IBM T.J. Watson Research Center, Jan. 1992.
[6] S. Chakravarthy et al.,“HiPAC: A research project in active, time-constrained database management,” Technical Report XAIT-89-02, Xerox Advanced Information Tech nology, July 1989.
[7] P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
[8] H.F. Korth and G. Speegle,“Formal aspects of concurrency control in long-duration transaction systems using the NT/PVmodel,” ACM Trans. Database Systems, 1994.
[9] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[10] J.E.B. Moss,“Nested transactions: An introduction,” B. Bhargava, ed., Concurrency Control and Reliability in Distributed Systems, Van Nostrand Reinhold, pp. 395-425, 1987.
[11] C.H. Papadimitriu and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, 1987.
[12] L.G. Khachian,“A polynomial algorithm for linear programming,” Doklady Akad. Nauk USSR, vol. 244, no. 5, 1979. Translated in Soviet Math. Doklady, 20.
[13] C. Papadimitriou, The Theory of Database Concurrency Control. Computer Science Press, 1986.
[14] E.L. Lawler,J.K. Lenstra,A.H.G. Rinnooy Kan,, and D.B. Shmoys,“Sequencing and scheduling: Algorithms and complexity,” S.C. Graves, A.H.G. Rinnooy Kan, and P. Zipkin, eds., Handbooks in Operations Research and Management Science, vol. 4. NorthHolland Publishing Co., 1992.
[15] Hard Real-Time Systems, J.A. Stankovic and K. Ramamritham, eds. IEEE CS Press, 1988.
[16] ACM SIGMOD Record, S.H. Son, ed., special issue on real-time databases, ACM Press, Mar. 1988.
[17] Real-Time Systems: Int’l J. Time-Critical Computing Systems, vol. 4, no. 3, special issue on real-time databases, Kluwer Press, Sept. 1992.
[18] A.P. Buchmann, D.R. McCarthy, M. Hsu, and U. Dayal, “Time-Critical Database Scheduling: A Framework for Integrating Real-Time Scheduling and Concurrency Control,” Proc. IEEE Int'l Conf. Data Eng., pp. 470–480, Feb. 1989.

Index Terms:
Databases, real-time systems, schceduling, concurrency control, transaction management.
Nandit Soparkar, Henry F. Korth, Abraham Silberschatz, "Databases with Deadline and Contingency Constraints," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 4, pp. 552-565, Aug. 1995, doi:10.1109/69.404029
Usage of this product signifies your acceptance of the Terms of Use.