Better burst detection

Xin Zhang, Dennis Shasha

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A burst is a large number of events occurring within a certain time window. Many data stream applications require the detection of bursts across a variety of window sizes. For example, stock traders may be interested in bursts having to do with institutional purchases or sales that are spread out over minutes or hours. In this paper, we present a new algorithmic framework for elastic burst detection [1]: a family of data structures that generalizes the Shifted Binary Tree, and a heuristic search algorithm to find an efficient structure given the input. We study how different inputs affect the desired structures and the probability to trigger a detailed search. Experiments on both synthetic and real world data show a factor of up to 35 times improvement compared with the Shifted Binary Tree over a wide variety of inputs, depending on the inputs.

Original languageEnglish (US)
Title of host publicationProceedings of the 22nd International Conference on Data Engineering, ICDE '06
Pages146
Number of pages1
Volume2006
DOIs
StatePublished - 2006
Event22nd International Conference on Data Engineering, ICDE '06 - Atlanta, GA, United States
Duration: Apr 3 2006Apr 7 2006

Other

Other22nd International Conference on Data Engineering, ICDE '06
CountryUnited States
CityAtlanta, GA
Period4/3/064/7/06

Fingerprint

Binary trees
Data structures
Sales
Experiments

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Engineering (miscellaneous)

Cite this

Zhang, X., & Shasha, D. (2006). Better burst detection. In Proceedings of the 22nd International Conference on Data Engineering, ICDE '06 (Vol. 2006, pp. 146). [1617514] https://doi.org/10.1109/ICDE.2006.30

Better burst detection. / Zhang, Xin; Shasha, Dennis.

Proceedings of the 22nd International Conference on Data Engineering, ICDE '06. Vol. 2006 2006. p. 146 1617514.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhang, X & Shasha, D 2006, Better burst detection. in Proceedings of the 22nd International Conference on Data Engineering, ICDE '06. vol. 2006, 1617514, pp. 146, 22nd International Conference on Data Engineering, ICDE '06, Atlanta, GA, United States, 4/3/06. https://doi.org/10.1109/ICDE.2006.30
Zhang X, Shasha D. Better burst detection. In Proceedings of the 22nd International Conference on Data Engineering, ICDE '06. Vol. 2006. 2006. p. 146. 1617514 https://doi.org/10.1109/ICDE.2006.30
Zhang, Xin ; Shasha, Dennis. / Better burst detection. Proceedings of the 22nd International Conference on Data Engineering, ICDE '06. Vol. 2006 2006. pp. 146
@inproceedings{3000f6a8aaa24fc8995cf4af2043092d,
title = "Better burst detection",
abstract = "A burst is a large number of events occurring within a certain time window. Many data stream applications require the detection of bursts across a variety of window sizes. For example, stock traders may be interested in bursts having to do with institutional purchases or sales that are spread out over minutes or hours. In this paper, we present a new algorithmic framework for elastic burst detection [1]: a family of data structures that generalizes the Shifted Binary Tree, and a heuristic search algorithm to find an efficient structure given the input. We study how different inputs affect the desired structures and the probability to trigger a detailed search. Experiments on both synthetic and real world data show a factor of up to 35 times improvement compared with the Shifted Binary Tree over a wide variety of inputs, depending on the inputs.",
author = "Xin Zhang and Dennis Shasha",
year = "2006",
doi = "10.1109/ICDE.2006.30",
language = "English (US)",
isbn = "0769525709",
volume = "2006",
pages = "146",
booktitle = "Proceedings of the 22nd International Conference on Data Engineering, ICDE '06",

}

TY - GEN

T1 - Better burst detection

AU - Zhang, Xin

AU - Shasha, Dennis

PY - 2006

Y1 - 2006

N2 - A burst is a large number of events occurring within a certain time window. Many data stream applications require the detection of bursts across a variety of window sizes. For example, stock traders may be interested in bursts having to do with institutional purchases or sales that are spread out over minutes or hours. In this paper, we present a new algorithmic framework for elastic burst detection [1]: a family of data structures that generalizes the Shifted Binary Tree, and a heuristic search algorithm to find an efficient structure given the input. We study how different inputs affect the desired structures and the probability to trigger a detailed search. Experiments on both synthetic and real world data show a factor of up to 35 times improvement compared with the Shifted Binary Tree over a wide variety of inputs, depending on the inputs.

AB - A burst is a large number of events occurring within a certain time window. Many data stream applications require the detection of bursts across a variety of window sizes. For example, stock traders may be interested in bursts having to do with institutional purchases or sales that are spread out over minutes or hours. In this paper, we present a new algorithmic framework for elastic burst detection [1]: a family of data structures that generalizes the Shifted Binary Tree, and a heuristic search algorithm to find an efficient structure given the input. We study how different inputs affect the desired structures and the probability to trigger a detailed search. Experiments on both synthetic and real world data show a factor of up to 35 times improvement compared with the Shifted Binary Tree over a wide variety of inputs, depending on the inputs.

UR - http://www.scopus.com/inward/record.url?scp=33749636117&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33749636117&partnerID=8YFLogxK

U2 - 10.1109/ICDE.2006.30

DO - 10.1109/ICDE.2006.30

M3 - Conference contribution

SN - 0769525709

SN - 9780769525709

VL - 2006

SP - 146

BT - Proceedings of the 22nd International Conference on Data Engineering, ICDE '06

ER -