approximating frequent items in asynchronous data stream over a sliding window近似频繁项在异步数据流滑动窗口.pdfVIP

Algorithms 2011, 3, 200-222; doi:10.3390/a4030200 OPEN ACCESS algorithms ISSN 1999-4893 /journal/algorithms Article Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window Hing-Fung Ting , Lap-Kei Lee , Ho-Leung Chan and Tak-Wah Lam Department of Computer Science, University of Hong Kong, Pokfulam, Hong Kong, China; E-Mails: hlchan@cs.hku.hk (H.-L.C.); twlam@cs.hku.hk (T.-W.L.) MADALGO (Center for Massive Data Algorithmics, a Center of the Danish National Research Foundation), Department of Computer Science, Aarhus University, Aarhus C DK-8000, Denmark; E-Mail: lklee@madalgo.au.dk Author to whom correspondence should be addressed; E-Mail: hfting@cs.hku.hk; Tel.:+852-2859-8944; Fax: +852-2549-7908. Received: 23 June 2011; in revised form: 23 June 2011 / Accepted: 10 September 2011 / Published: 22 September 2011 Abstract: 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 sufficient accuracy. Prior to our work, the best solution is given by Cormode et al. [1], who gave an - space data structure that can approximate the frequent items within an error bound, where and are parameters of the sliding window, and is the set of all possible