This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Temporal Triggers in Active Databases
June 1995 (vol. 7 no. 3)
pp. 471-486

Abstract—In this paper we propose two languages, called Future Temporal Logic (FTL) and Past Temporal Logic (PTL), for specifying temporal triggers. Some examples of trigger conditions that can be specified in our language are the following: “The value of a certain attribute increases by more than 10% in 10 minutes,”“A tuple that satisfies a certain predicate is added to the database at least 10 minutes before another tuple, satisfying a different condition, is added to the database.” Such triggers are important for monitor and control applications.

In addition to the languages, we present algorithms for processing the trigger conditions specified in these languages, namely, procedures for determining when the trigger conditions are satisfied. These methods can be added as a “temporal” component to an existing database management systems. A preliminary prototype of the temporal component that uses the FTL language has been built on top of Sybase running on SUN workstations.

[1] R. Alur and T.A. Henzinger, Real-Time Logics: Complexity and Expressiveness Proc. Fifth Ann. IEEE Symp. Logic in Computer Science, pp. 390-401, 1990.
[2] J.A. Blakeley, P. Larson, and F.W. Tompa, "Efficiently Updating Materialized Views," Proc. ACM SIGMOD Conf.,Washington, D.C., pp. 61-71, May 1986.
[3] J.A. Blakeley, N. Coburn, and P.-A. Larson, “Updating Derived Relations: Detecting Irrelevant and Autonomously Computable Updates,” ACM Trans. Database Systems, vol. 14, no. 3, pp. 369-400, Sept. 1989.
[4] J. Chomicki,“History-less checking of dynamic integrity constraints,” IEEE Int’l Conf. Data Engineering,Phoenix Ariz, Feb. 1992.
[5] J. Chomicki,“Real-time integrity constraints,” Proc. 11th ACM SIGACT-SIGMOD-SIGART Symp. Principles Database Systems, June 1992.
[6] D. Cohen, "Compiling Complex Database Transition Triggersm," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 225-234,Portland, Ore., ACM Press, 1989.
[7] S. Ceri and J. Widom,“Production rules in parallel and distributed database environments,” Proc. VLDB’92, 1992.
[8] S. Chakravarthy et. al., HiPAC: A Research Project in Active, Time-Constrained Database Management, TR XAIT-89-02, Xerox Advanced Information Technology.
[9] U. Dayal,“Active database management systems,” Proc. Third Int’l Conf. Data and Knowledge Bases_Improving Usability and Responsiveness,Jerusalem, June 1988.
[10] T. Dean,“Using temporal hierarchies to efficiently maintain large temporal databases,” JACM, vol. 36, no. 4, Oct. 1989.
[11] M. Darnovsky and J. Bowman,“Transact-SQL User’s Guide,” Document 3231-2.1, Sybase Inc., 1987.
[12] A. Dupuy,S. Sengupta,O. Wolfson,, and Y. Yemini,Design of the NetMate Network Management System. Integrated Network Management II, I. Krishnan and W. Zimmer, eds., Elsevier Science Publishers B.V., North Holland.
[13] A. Dupuy,S. Sengupta,O. Wolfson,, and Y. Yemini;, “NetMate: A network management environment,” to appear in the special issue on Network Operations and Management, IEEE Network, The Magazine of Computer Communications, 1991.
[14] N.H. Gehani, H.V. Jagadish, and O. Shmueli, "Event Specification in an Object-Oriented Database," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 81-90, 1992.
[15] N.H. Gehani et. al., “Composite event specification in active databases: Model and implementation,” Proc. 18th Int’l Conf. Very Large Databases, Aug. 1992.
[16] E.N. Hanson,M. Chaabouni,C. Kim, and Y. Wang,"A predicate matching algorithm for database rule systems," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 271-280, May 1990.
[17] T. Henzinger,“Half-order modal logic: How to prove real-time properties,” Proc. Ninth ACM Symp. Principles of Distributed Computing, pp. 281-296, 1990.
[18] E.N. Hanson and J. Widom,“An overview of production rules in database systems,” Research Report RJ9023, IBM Research Division, 1992.
[19] C.S. Jensen, L. Mark, and N. Roussopoulos, "Incremental Implementation Model for Relational Databases with Transaction Time," IEEE Trans. Knowledge and Data Engineering, vol. 3, no. 4, pp. 461-473, Dec. 1991.
[20] A. Kotz,K. Dittrich,, and J. Mulle,“Supporting semantic rules by a generalized event/trigger mechanism,” Proc. Int’l Conf. Extending Database Technology,Venice, Mar. 1988.
[21] G. Kiernan,C. de Maindreville,, and E. Simon,“Making deductive database a practical technology: A step forward,” Proc. ACM-SIGMOD Int’l Conf. Management of Data, 1990.
[22] U.W. Lipeck and G. Saake,“Monitoring dynamic integrity constraints based on temporal logic,” Information Systems, vol. 12, no. 3, pp. 255-269, 1987.
[23] U.W. Lipeck and G. Saake,“Using finite-linear temporal logic for specifying database dynamics,” Lecture Notes in Computer Science, Springer Verlag, 1988.
[24] Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, 1991.
[25] X. Qian and G. Wiederhold, Incremental Recomputation of Active Relational Expressions IEEE Trans. Knowledge and Data Eng. (TKDE), vol. 3, no. 3, pp. 337-341, Sept. 1991.
[26] T. Risch,“Monitoring database objects,” Proc. VLDB, Aug. 1989.
[27] R.R. Razouk and M.M. Gorlik,“A real time interval logic for reasoning about executions of real-time programs,” Proc. ACM-SIGSOFT Conf., 1989.
[28] Special issue on rule management and processing in expert database systems, T. Sellis, ed., SIGMOD Record, vol. 18, no. 3, Sept. 1989.
[29] A. Segev and H. Gunadhi, "Event-Join Optimization in Temporal Relational Databases," Proc. VLDB Conf., pp. 205-215, Aug. 1989.
[30] R. Stonebraker,A. Jhingran,J. Goh,, and S. Potamianos,“On rules, procedures, caching, and views in database systems,” ACM SIGMOD Int’l Conf. Management of Data, 1990.
[31] R.T. Snodgrass, “The Temporal Query Language TQuel,” ACM Trans. Database Systems, vol. 12, no. 2, pp. 247–298, 1987.
[32] Data Engineering, R. Snodgrass, ed., special issue on temporal databases, Dec. 1988.
[33] A. Segev and A. Shoshani, "Logical Modeling of Temporal Data," Proc. ACM SIGMOD Conf. Management of Data, pp. 454-466, May 1987.
[34] A. Segev and A. Shoshani, "The Representation of a Temporal Data Model in the Relational Environment," Proc. Fourth Int'l Conf. Statistical and Scientific Database Management, 1988.
[35] L.J. Stockmeyer,“The complexity of decision procedures in automata theory and logic,” doctoral dissertation, MIT, Cambridge, Mass. Project MAC Tech. Report TR-133, 1974.
[36] A.P. Sistla and O. Wolfson,“Temporal triggers in active databases,” Tech. Report, EECS Dept., Univ. of Illinois, Chicago, 1994.
[37] A. Tuzhilin and J. Clifford,“A temporal relational algebra as a basis for temporal relational completeness,” Proc. 16th VLDB Conf., 1990.
[38] J. Ullman, Principles of Database and Knowledge-Base Systems, vol. 1. Computer Science Press, 1988.
[39] J. Widom and S.J. Finkelstein,"Set-oriented production rules in relational database systems," Proc. 1990 ACM SIGMOD Int'l Conf. Management of Data, pp. 259-270, 1990.
[40] O. Wolfson, S. Sengupta, and Y. Yemini, “Managing Communication Networks by Monitoring Databases,” IEEE Trans. Software Eng., vol. 17, no. 9, pp. 944-953, Sept. 1991.
[41] Y. Yemini and O. Wolfson,“NetMate: Management of complex distributed networked systems (project synopsis),” Proc. First Int’l Conf. Parallel and Distributed Information Systems, Dec. 1991.

Index Terms:
Active databases, triggers, temporal logics, algorithms.
Citation:
A. Prasad Sistla, Ouri Wolfson, "Temporal Triggers in Active Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 3, pp. 471-486, June 1995, doi:10.1109/69.390251
Usage of this product signifies your acceptance of the Terms of Use.