Abstract
A key facility of active database management systems is their ability to detect and react to the occurrence of events. Such events can be either atomic in nature, or specified using an event algebra to form complex events. An important role of an event algebra is to define the semantics of when events become invalid (event consumption). In this paper, we examine a simple event algebra and provide a logical framework for specification of various consumption policies. We then study the problems of equivalence and implication, identifying a powerful class of complex events for which equivalence is decidable. We then demonstrate how extensions of this class lead to undecidability.
Supported by EPSRC No. GR/L26872.
In this paper, we will use the terms complex event detection and (complex) event query evaluation over a history synonymously.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. Chakravarthy, V. Krishnaprasad, E. Anwar, and S.-K. Kim. Composite events for active databases: semantics, contexts and detection. In 20th International Conference on Very Large Data Bases, pages 606–617, 1994.
J. Chomicki and D. Toman. Implementing temporal integrity constraints using an active dbms. IEEE TKDE, 7(4):566–581, 1995.
O. Diaz, N.W. Paton, and J. Iturrioz. Formalizing and validating behavioral models through the event calculus. Information Systems, 23(3–4):179–196, 1998.
S. Gatziu and K. Dittrich. Detecting composite events in active database systems using Petri nets. In Proceedings of the 4th International Workshop on Research Issues in Data Engineering, pages 2–9, Houston, Texas, 1994.
N. Gehani, H. V. Jagadish, and O. Shmueli. Composite event specification in active databases: Model and implementation. In VLDB’92, pages 327–338, 1992.
A. Geppert and K. Dittrich. Performance assessment. In N. Paton, editor, Active Rules in Database Systems, pages 103–123. Springer-Verlag, 1999.
I. Hodkinson. On Gabbay’s temporal fixed point operator. Journal of Theoretical Computer Science, 139:1–25, 1995.
M. Minsky. Computation: Finite and Infinite Machines. Prentice Hall, 1967.
I. Mirbel, B. Pernici, T. Sellis, S. Tserkezoglou, and M. Vazirgiannis. Checking temporal integrity of interactive multimedia documents. The VLDB Journal, 9(2):111–130, 2000.
I. Motakis and C. Zaniolo. Formal semantics for composite temporal events in active database rules. Journal of Systems Integration, 7(3–4):291–325, 1997.
N. Paton, editor. Active Rules in Database Systems. Springer-Verlag, 1999.
A. Sistla and E. Clark. Complexity of propositional linear temporal logics. Journal of the ACM, 32:733–749, 1985.
A. P. Sistla and O. Wolfson. Temporal triggers in active databases. IEEE Transaction on KNowledge and Data Engineering, 7(3):471–486, 1995.
L. G. Valiant and Paterson M. S. Deterministic one-counter automata. Journal of Computer and System Sciences, 10(3):340–250, 1975.
D. Zimmer and R. Unland. On the semantics of complex events in active database management systems. In ICDE’99, pages 392–399, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bailey, J., Mikulás, S. (2001). Expressiveness Issues and Decision Problems for Active Database Event Queries. In: Van den Bussche, J., Vianu, V. (eds) Database Theory — ICDT 2001. ICDT 2001. Lecture Notes in Computer Science, vol 1973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44503-X_5
Download citation
DOI: https://doi.org/10.1007/3-540-44503-X_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41456-8
Online ISBN: 978-3-540-44503-6
eBook Packages: Springer Book Archive