Skip to main content

Grouping Methods for Pattern Matching in Probabilistic Data Streams

  • Conference paper
  • First Online:
Database Systems for Advanced Applications (DASFAA 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9049))

Included in the following conference series:

Abstract

In recent years, complex event processing has attracted considerable interest in research and industry.Pattern matching is used to find complex events in data streams. In probabilistic data streams, however, the system may find multiple matches in a given time interval. This may result in inappropriate matches, because multiple matches may correspond to a single event. We therefore propose grouping methods of matches for probabilistic data streams, and call such merged matches a group. We describe the definitions and generation methods of groups, propose an efficient approach for calculating an occurrence probability of a group, and compare the proposed approach with a naïve one by experiment. The results demonstrate the properties and effectiveness of the proposed method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, J., Diao, Y., Gyllstrom, D., Immerman, N.: Efficient pattern matching over event streams. In: Proc. ACM SIGMOD, pp. 147–160 (2008)

    Google Scholar 

  2. Akdere, M., Çetintemel, U., Tatbul, N.: Plan-based complex event detection across distributed sources. Proc. VLDB Endow. 1(1), 66–77 (2008)

    Article  Google Scholar 

  3. Chandramouli, B., Goldstein, J., Maier, D.: High-performance dynamic pattern matching over disordered streams. Proc. VLDB Endow. 3(1–2), 220–231 (2010)

    Article  Google Scholar 

  4. Demers, A., Gehrke, J., Panda, B.: Cayuga: A general purpose event monitoring system. In: Proc. CIDR, pp. 412–422 (2007)

    Google Scholar 

  5. Gyllstrom, D., Agrawal, J., Diao, Y., Immerman, N.: On supporting Kleene closure over event streams. In: Proc. ICDE, pp. 1391–1393 (2008)

    Google Scholar 

  6. Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: A review. ACM Comput. Surv. 31(3), 264–323 (1999)

    Article  Google Scholar 

  7. Letchner, J., Ré, C., Balazinska, M., Philipose, M.: Access methods for Markovian streams. In: Proc. ICDE, pp. 246–257 (2009)

    Google Scholar 

  8. Letchner, J., Ré, C., Balazinska, M., Philipose, M.: Approximation trade-offs in Markovian stream processing: An empirical study. In: Proc. ICDE, pp. 936–939 (2010)

    Google Scholar 

  9. Li, Z., Ge, T., Chen, C.X.: \(\varepsilon \)-matching: Event processing over noisy sequences in real time. In: Proc. ACM SIGMOD, pp. 601–612 (2013)

    Google Scholar 

  10. Liu, M., Golovnya, D., Rundensteiner, E.A., Claypool, K.T.: Sequence pattern query processing over out-of-order event streams. In: Proc. ICDE, pp. 784–795 (2009)

    Google Scholar 

  11. Majumder, A., Rastogi, R., Vanama, S.: Scalable regular expression matching on data streams. In: Proc. ACM SIGMOD, pp. 161–172 (2008)

    Google Scholar 

  12. Mei, Y., Madden, S.: ZStream: A cost-based query processor for adaptively detecting composite events. In: Proc. ACM SIGMOD, pp. 193–206 (2009)

    Google Scholar 

  13. Mozafari, B., Zeng, K., Zaniolo, C.: High-performance complex event processing over XML streams. In: Proc. ACM SIGMOD, pp. 253–264 (2012)

    Google Scholar 

  14. Qi, Y., Cao, L., Ray, M., Rundensteiner, E.A.: Complex event analytics: Online aggregation of stream sequence patterns. In: Proc. ACM SIGMOD, pp. 229–240 (2014)

    Google Scholar 

  15. Ré, C., Letchner, J., Balazinksa, M., Suciu, D.: Event queries on correlated probabilistic streams. In: Proc. ACM SIGMOD, pp. 715–728 (2008)

    Google Scholar 

  16. Woods, L., Teubner, J., Alonso, G.: Complex event detection at wire speed with FPGAs. Proc. VLDB Endow. 3(1–2), 660–669 (2010)

    Article  Google Scholar 

  17. Wu, E., Diao, Y., Rizvi, S.: High-performance complex event processing over streams. In: Proc. ACM SIGMOD, pp. 407–418 (2006)

    Google Scholar 

  18. Zhang, H., Diao, Y., Immerman, N.: Recognizing patterns in streams with imprecise timestamps. Proc. VLDB Endow. 3(1–2), 244–255 (2010)

    Article  Google Scholar 

  19. Zhang, H., Diao, Y., Immerman, N.: On complexity and optimization of expensive queries in complex event processing. In: Proc. ACM SIGMOD, pp. 217–228 (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kento Sugiura .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Sugiura, K., Ishikawa, Y., Sasaki, Y. (2015). Grouping Methods for Pattern Matching in Probabilistic Data Streams. In: Renz, M., Shahabi, C., Zhou, X., Cheema, M. (eds) Database Systems for Advanced Applications. DASFAA 2015. Lecture Notes in Computer Science(), vol 9049. Springer, Cham. https://doi.org/10.1007/978-3-319-18120-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18120-2_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18119-6

  • Online ISBN: 978-3-319-18120-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics