Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window

Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window

In an asynchronous data stream, the data items may be out of order with respect to their original timestamps. This paper studies the space complexity required by a data structure to maintain such a data stream so that it can approximate the set of frequent items over a sliding time window with suffi...

Full description

Bibliographic Details
Main Authors: Ho-Leung Chan, Tak-Wah Lam, Hing-Fung Ting, Lap-Kei Lee
Format: Article
Language:English
Published: MDPI AG 2011-09-01
Series:Algorithms
Subjects:
asynchronous data streams
frequent items
sliding window
space complexity
Online Access:http://www.mdpi.com/1999-4893/4/3/200/

Internet

http://www.mdpi.com/1999-4893/4/3/200/

Similar Items