Expressiveness Issues and Decision Problems for Active Database Event Queries

  • James Bailey
  • Szabolcs Mikulás
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1973)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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.Google Scholar
  2. 2.
    J. Chomicki and D. Toman. Implementing temporal integrity constraints using an active dbms. IEEE TKDE, 7(4):566–581, 1995.Google Scholar
  3. 3.
    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.CrossRefGoogle Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    N. Gehani, H. V. Jagadish, and O. Shmueli. Composite event specification in active databases: Model and implementation. In VLDB’92, pages 327–338, 1992.Google Scholar
  6. 6.
    A. Geppert and K. Dittrich. Performance assessment. In N. Paton, editor, Active Rules in Database Systems, pages 103–123. Springer-Verlag, 1999.Google Scholar
  7. 7.
    I. Hodkinson. On Gabbay’s temporal fixed point operator. Journal of Theoretical Computer Science, 139:1–25, 1995.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    M. Minsky. Computation: Finite and Infinite Machines. Prentice Hall, 1967.Google Scholar
  9. 9.
    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.CrossRefGoogle Scholar
  10. 10.
    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.CrossRefGoogle Scholar
  11. 11.
    N. Paton, editor. Active Rules in Database Systems. Springer-Verlag, 1999.Google Scholar
  12. 12.
    A. Sistla and E. Clark. Complexity of propositional linear temporal logics. Journal of the ACM, 32:733–749, 1985.zbMATHCrossRefGoogle Scholar
  13. 13.
    A. P. Sistla and O. Wolfson. Temporal triggers in active databases. IEEE Transaction on KNowledge and Data Engineering, 7(3):471–486, 1995.CrossRefGoogle Scholar
  14. 14.
    L. G. Valiant and Paterson M. S. Deterministic one-counter automata. Journal of Computer and System Sciences, 10(3):340–250, 1975.zbMATHMathSciNetGoogle Scholar
  15. 15.
    D. Zimmer and R. Unland. On the semantics of complex events in active database management systems. In ICDE’99, pages 392–399, 1999.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • James Bailey
    • 1
  • Szabolcs Mikulás
    • 1
  1. 1.Department of Computer Science, Birkbeck CollegeUniv. of LondonLondonUK

Personalised recommendations