Abstract

Burst detection techniques over data streams has been attracting board and home scholars' more attention due to it's broad applications in financial, medical service, telecommunication and other critical important areas. In order to detect bursts of positive data streams, negative data streams, first, we propose a dynamic burst detection model over data stream. Based on the model, we embed a two-dimensional array into SAT(shifted aggregation tree), and construct a elastic data structure ASAT given the input. At last, we propose a elastic burst detection algorithm over data streams. The algorithm not only can detect bursts of monotonous accumulation function and non-monotonous accumulation function, but also can search burst on large scale of negative, constant data streams. Experiments show that this algorithm is both efficient and effective.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.