首页    期刊浏览 2024年11月27日 星期三
登录注册

文章基本信息

  • 标题:Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window
  • 作者:Ho-Leung Chan ; Tak-Wah Lam ; Lap-Kei Lee
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2010
  • 卷号:5
  • 页码:179-190
  • DOI:10.4230/LIPIcs.STACS.2010.2453
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:The past decade has witnessed many interesting algorithms for maintaining statistics over a data stream. This paper initiates a theoretical study of algorithms for monitoring distributed data streams over a time-based sliding window (which contains a variable number of items and possibly out-of-order items). The concern is how to minimize the communication between individual streams and the root, while allowing the root, at any time, to be able to report the global statistics of all streams within a given error bound. This paper presents communication-efficient algorithms for three classical statistics, namely, basic counting, frequent items and quantiles. The worst-case communication cost over a window is $O(\frac{k}{\varepsilon} \log \frac{\varepsilon N}{k})$ bits for basic counting and $O(\frac{k}{\varepsilon} \log \frac{N}{k})$ words for the remainings, where $k$ is the number of distributed data streams, $N$ is the total number of items in the streams that arrive or expire in the window, and $\varepsilon < 1$ is the desired error bound. Matching and nearly matching lower bounds are also obtained.
  • 关键词:Algorithms; distributed data streams; communication efficiency; frequent items
Loading...
联系我们|关于我们|网站声明
国家哲学社会科学文献中心版权所有