Triggered Real-Time Databases with Consistency Constraints

Abstract Real-time database systems incorporate the notion of a deadline into the database system model. USU- ally, deadlines are associated with transactions, and the system attempts to execute a given set of trans- actions so as to both meet the deadlines and ensure the database consistency. This paper presents an al- ternative model of real-time database processing in which deadlines are associated with consistency con- straints rather than directly with transactions. This model leads to a predicate-baaed approach to transac- tion management that allows greater concurrency and more flexibility in modeling real-world systems. 1 Introduction Real-time database systems (RTDBs) incorporate tim- ing considerations into a database system. Not only must the transactions execute correctly, but also, they must complete execution within some time limit called a deadline. Systems that incorporate strict deadlines are called

[1]  Hector Garcia-Molina,et al.  Scheduling real-time transactions , 1988, SGMD.

[2]  Abraham Silberschatz,et al.  A Formal Approach to Recovery by Compensating Transactions , 1990, VLDB.

[3]  Jim Gray,et al.  The Transaction Concept: Virtues and Limitations (Invited Paper) , 1981, VLDB.

[4]  Umeshwar Dayal,et al.  The architecture of an active database management system , 1989, SIGMOD '89.

[5]  Louis E. Rosier,et al.  The pinwheel: a real-time scheduling problem , 1989, [1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track.

[6]  Mukesh Singhal,et al.  Issues and approaches to design of real-time database systems , 1988, SGMD.

[7]  J.A. Stankovic,et al.  Misconceptions about real-time computing: a serious problem for next-generation systems , 1988, Computer.

[8]  John A. Stankovic,et al.  Misconceptions About Real-Time Computing , 1988, Computer.

[9]  Lui Sha,et al.  Concurrency control for distributed real-time databases , 1988, SGMD.

[10]  J. Eliot B. Moss,et al.  Nested transactions: an introduction , 1987 .

[11]  Jim Gray,et al.  The Transaction Concept: Virtues and Limitations (Invited Paper) , 1981, VLDB.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Charles L. Forgy,et al.  Rete: a fast algorithm for the many pattern/many object pattern match problem , 1991 .

[14]  Catriel Beeri,et al.  A model for concurrency in nested transactions systems , 1989, JACM.

[15]  Henry F. Korth,et al.  Formal model of correctness without serializabilty , 1988, SIGMOD '88.

[16]  Thanasis Hadzilacos,et al.  Transaction synchronisation in object bases , 1988, PODS '88.

[17]  Hector Garcia-Molina,et al.  Scheduling real-time transactions: a performance evaluation , 1988, TODS.

[18]  Aloysius K. Mok,et al.  Safety analysis of timing properties in real-time systems , 1986, IEEE Transactions on Software Engineering.

[19]  Andreas Reuter,et al.  High contention in a stock trading database: a case study , 1988, SIGMOD '88.

[20]  Won Kim,et al.  On Long-Duration CAD Transactions , 1989, Inf. Sci..

[21]  Charles L. Forgy,et al.  Rete: A Fast Algorithm for the Many Patterns/Many Objects Match Problem , 1982, Artif. Intell..