skip to main content
10.1145/1529282.1529619acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Adaptive burst detection in a stream engine

Published:08 March 2009Publication History

ABSTRACT

Detecting bursts in data streams is an important and challenging task. Due to the complexity of this task, usually burst detection cannot be formulated using standard query operators. Therefore, we show how to integrate burst detection for stationary as well as non-stationary data into query formulation and processing, from the language level to the operator level. Afterwards, we present fundamentals of threshold-based burst detection. We focus on the applicability of time series forecasting techniques in order to dynamically identify suitable thresholds for stream data containing arbitrary trends and periods. The proposed approach is evaluated with respect to quality and performance on synthetic and real-world sensor data using a full-fledged DSMS.

References

  1. Arasu, A., Babu, S., and Widom, J. The CQL Continuous Query Language: Semantic Foundations and Query Execution. Tech. rep., University of Stanford, 2003.Google ScholarGoogle Scholar
  2. Chatfield, C., and Yar, M. Holt-Winters Forecasting: Some Practical Issues. The Statistician, Special Issue: Statistical Forecasting and Decision-Making 37, 2 (1988), 129--140.Google ScholarGoogle Scholar
  3. Ergün, F., Muthukrishnan, S., and Sahinalp, S. C. Sublinear methods for detecting periodic trends in data streams. In LATIN (2004).Google ScholarGoogle Scholar
  4. Hinneburg, A., Habich, D., and Karnstedt, M. Analyzing Data Streams by Online DFT. In IWKDDS-2006 (2006), pp. 67--76.Google ScholarGoogle Scholar
  5. Keogh, E., Lonardi, S., and chi' Chiu, B. Y. Finding surprising patterns in a time series database in linear time and space. In KDD'02 (2002), pp. 550--556. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Kleinberg, J. M. Bursty and hierarchical structure in streams. Data Min. Knowl. Discov. 7, 4 (2003), 373--397. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Papadimitriou, S., Brockwell, A., and Faloutsos, C. AWSOM: Adaptive, Hands-Off Stream Mining. In VLDB 2003 (2003), pp. 560--571. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Shahabi, C., Tian, X., and Zhao, W. Tsa-tree: A wavelet-based approach to improve the efficiency of multi-level surprise and trend queries on time-series data. In SSDBM'00 (2000), p. 55. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Shasha, D., and Zhu, Y. High Performance Discovery in Time Series: Techniques and Case Studies. Springer, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Vlachos, M., Meek, C., Vagena, Z., and Gunopulos, D. Identifying Similarities, Periodicities and Bursts for Online Search Queries. In SIGMOD 2004 (2004), pp. 131--142. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Wang, M., Madhyastha, T. M., Chan, N. H., Papadimitriou, S., and Faloutsos, C. Data mining meets performance evaluation: Fast algorithms for modeling bursty traffic. In ICDE (2002).Google ScholarGoogle Scholar
  12. Yamanishi, K., and Takeuchi, J.-I. A Unifying Framework for Detecting Outliers and Change Points from Non-stationary Time Series Data. In SIGKDD 2002 (2002), pp. 676--681. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Zhang, X., and Shasha, D. Better burst detection. In ICDE'06 (2006), pp. 146--149. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Zhu, Y., and Shasha, D. Efficient Elastic Burst Detection in Data Streams. In SIGKDD 2003, Washington, D.C., USA (2003), pp. 336--345. Google ScholarGoogle ScholarDigital LibraryDigital Library

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 Conferences
    SAC '09: Proceedings of the 2009 ACM symposium on Applied Computing
    March 2009
    2347 pages
    ISBN:9781605581668
    DOI:10.1145/1529282

    Copyright © 2009 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: 8 March 2009

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article

    Acceptance Rates

    Overall Acceptance Rate1,650of6,669submissions,25%

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader