skip to main content
10.1145/1385989.1386008acmotherconferencesArticle/Chapter ViewAbstractPublication PagesdebsConference Proceedingsconference-collections
research-article

Relative temporal constraints in the Rete algorithm for complex event detection

Published:01 July 2008Publication History

ABSTRACT

Complex Event Processing is an important technology for information systems with a broad application space ranging from supply chain management, systems monitoring, and stock market analysis to news services. Its purpose is the identification of event patterns with logical, temporal or causal relationships within multiple occurring events.

The Rete algorithm is commonly used in rule-based systems to trigger certain actions if a corresponding rule holds. Its good performance for a high number of rules in the rulebase makes it ideally suited for complex event detection. However, the traditional Rete algorithm is limited to operations such as unification and the extraction of predicates from a knowledge base. There is no support for temporal operators.

We propose an extension of the Rete algorithm to support the detection of relative temporal constraints. Further, we propose an efficient means to perform the garbage collection in the Rete algorithm in order to discard events after they can no longer fulfill their temporal constraints. Finally, we present an extension of Allen's thirteen operators for time-intervals with quantitative constraints to deal with too restrictive or too permissive operators by introducing tolerance limits or restrictive conditions for them.

References

  1. J. F. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26:832--843, 1983. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. B. Berstel. Extending the RETE Algorithm for Event Management. In TIME '02: Proceedings of the Ninth International Symposium on Temporal Representation and Reasoning (TIME'02), page 49, Washington, DC, USA, 2002. IEEE Computer Society. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. H. Bohlen, R. Busatto, and C. S. Jensen. Point-versus interval-based temporal data models. In ICDE, pages 192--200, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. F. Bry and M. Eckert. Temporal order optimizations of incremental joins for composite event detection. In Proceedings of Inaugural Int. Conference on Distributed Event-Based Systems, Toronto, Canada (20th--22nd June 2007). ACM, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. A. J. Demers, J. Gehrke, B. Panda, M. Riedewald, V. Sharma, and W. M. White. Cayuga: A general purpose event monitoring system. In CIDR, pages 412--422, 2007.Google ScholarGoogle Scholar
  6. C. Forgy. Rete: A fast algorithm for the many patterns/many objects match problem. Artif. Intell., 19(1):17--37, 1982.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. A. Galton and J. Augusto. Two approaches to event definition. In Lecture Notes In Computer Science. Proceedings of the 13th International Conference on Database and Expert Systems Applications, volume 2453, pages 547--556, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. JBoss. JBoss Rules, 2007. http://labs.jboss.com/drools/.Google ScholarGoogle Scholar
  9. L. Lamport. Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 21(7):558--565, July 1978. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. G. Li and H.-A. Jacobsen. Composite subscriptions in content-based publish/subscribe systems. In Middleware, pages 249--269, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. A. Maloof and K. Kochut. Modifying Rete to Reason Temporally. In ICTAI, pages 472--473, 1993.Google ScholarGoogle ScholarCross RefCross Ref
  12. I. Meiri. Combining qualitative and quantitative constraints in temporal reasoning. In T. Dean and K. McKeown, editors, Proceedings of the Ninth National Conference on Artificial Intelligence, pages 260--267, Menlo Park, California, 1991. AAAI Press.Google ScholarGoogle Scholar
  13. Red Hat, Inc. Drools development branch for temporal reasoning. Online. http://anonsvn.labs.jboss.com/labs/jbossrules/branches/temporal_rete/.Google ScholarGoogle Scholar
  14. U. Srivastava and J. Widom. Flexible time management in data stream systems. In PODS '04: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 263--274, New York, NY, USA, 2004. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. D. Teodosiu and G. Pollak. Discarding unused temporal information in a production system. In Proc. of the ISMM International Conference on Information and Knowledge Management CIKM-92, pages 177--184, Baltimore, MD, 1992.Google ScholarGoogle Scholar
  16. M. Vilain, H. Kautz, and P. van Beek. Constraint propagation algorithms for temporal reasoning: a revised report. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1990.Google ScholarGoogle ScholarCross RefCross Ref
  17. W. M. White, M. Riedewald, J. Gehrke, and A. J. Demers. What is "next" in event processing? In PODS, pages 263--272. ACM, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. E. Wu, Y. Diao, and S. Rizvi. High-performance complex event processing over streams. In SIGMOD '06: Proceedings of the 2006 ACM SIGMOD international conference on Management of data, pages 407--418, New York, NY, USA, 2006. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. E. Yoneki and J. Bacon. Unified semantics for event correlation over time and space in hybrid network environments. In OTM Conferences (1), pages 366--384, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Relative temporal constraints in the Rete algorithm for complex event detection

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        DEBS '08: Proceedings of the second international conference on Distributed event-based systems
        July 2008
        377 pages
        ISBN:9781605580906
        DOI:10.1145/1385989

        Copyright © 2008 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 July 2008

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate130of553submissions,24%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader