Advertisement

A Robust Skip-Till-Next-Match Selection Strategy for Event Pattern Matching

Conference paper
  • 947 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8716)

Abstract

In event pattern matching, various selection strategies have been proposed to impose additional constraints on the events that participate in a match. The skip-till-next-match selection strategy is used in scenarios where some incoming events are noise and therefore should be ignored. Skip-till-next-match is prone to blocking noise, i.e., noise that prevents the detection of matches. In this paper, we propose the robust skip-till-next-match selection strategy, which is robust against noise and finds matches that are missed by skip-till-next-match when blocking noise occurs in the input stream. To implement the new strategy in automaton-based pattern matching algorithms, we propose a backtracking mechanism. Extensive experiments using real-world data and different event pattern matching algorithms show that with skip-till-next-match the number of matches not detected due to blocking noise can be substantial, and that our backtracking mechanism outperforms alternative solutions that first produce a superset of the result followed by a post processing step to filter out non-compliant matches.

Keywords

Selection Strategy Leaf Node Trade Volume Pattern Match Noise Event 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Adi, A., Etzion, O.: Amit - the situation manager. The VLDB Journal 13(2), 177–203 (2004)CrossRefGoogle Scholar
  2. 2.
    Agrawal, J., Diao, Y., Gyllstrom, D., Immerman, N.: Efficient pattern matching over event streams. In: SIGMOD, pp. 147–160 (2008)Google Scholar
  3. 3.
    Cadonna, B., Gamper, J., Böhlen, M.H.: Sequenced event set pattern matching. In: EDBT, pp. 33–44 (2011)Google Scholar
  4. 4.
    Cugola, G., Margara, A.: Complex event processing with T-REX. J. Syst. Softw. 85(8), 1709–1728 (2012)CrossRefGoogle Scholar
  5. 5.
    Demers, A., Gehrke, J., Hong, M., Riedewald, M., White, W.: Towards expressive publish/Subscribe systems. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., Böhm, K., Kemper, A., Grust, T., Böhm, C. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 627–644. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  6. 6.
    Dindar, N., Güç, B., Lau, P., Ozal, A., Soner, M., Tatbul, N.: Dejavu: declarative pattern matching over live and archived streams of events. In: SIGMOD, pp. 1023–1026 (2009)Google Scholar
  7. 7.
    Harada, L., Hotta, Y.: Order checking in a CPOE using event analyzer. In: CIKM, pp. 549–555 (2005)Google Scholar
  8. 8.
    Liu, M., Rundensteiner, E., Dougherty, D., Gupta, C., Wang, S., Ari, I., Mehta, A.: High-performance nested cep query processing over event streams. In: ICDE, pp. 123–134 (2011)Google Scholar
  9. 9.
    Mei, Y., Madden, S.: Zstream: A cost-based query processor for adaptively detecting composite events. In: SIGMOD, pp. 193–206 (2009)Google Scholar
  10. 10.
    Sadri, R., Zaniolo, C., Zarkesh, A., Adibi, J.: Expressing and optimizing sequence queries in database systems. ACM Trans. Database Syst. 29(2), 282–318 (2004)CrossRefGoogle Scholar
  11. 11.
    Schultz-Møller, N.P., Migliavacca, M., Pietzuch, P.: Distributed complex event processing with query rewriting. In: DEBS, pp. 4:1–4:12 (2009)Google Scholar
  12. 12.
    Zemke, F., Witkowski, A., Cherniak, M., Colby, L.: Pattern matching in sequences of rows. Tech. rep. (2007)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Humboldt-Universität zu BerlinGermany
  2. 2.Free University of Bozen-BolzanoItaly
  3. 3.University of ZurichSwitzerland

Personalised recommendations