Dynamically maintaining duplicate-insensitive and time-decayed sum using time-decaying bloom filter

Yu Zhang, Hong Shen, Hui Tian, Xianchao Zhang

研究成果: Conference contribution同行評審

1 引文 斯高帕斯(Scopus)

摘要

The duplicate-insensitive and time-decayed sum of an arbitrary subset in a stream is an important aggregation for various analyses in many distributed stream scenarios. In general, precisely providing this sum in an unbounded and high-rate stream is infeasible. Therefore, we target at this problem and introduce a sketch, namely, time-decaying Bloom Filter (TDBF). The TDBF can detect duplicates in a stream and meanwhile dynamically maintain decayed-weight of all distinct elements in the stream according to a user-specified decay function. For a query for the current decayed sum of a subset in the stream, TDBF provides an effective estimation. In our theoretical analysis, a provably approximate guarantee has been given for the error of the estimation. In addition, the experimental results on synthetic stream validate our theoretical analysis.

原文English
主出版物標題Algorithms and Architectures for Parallel Processing - 9th International Conference, ICA3PP 2009, Proceedings
頁面741-750
頁數10
DOIs
出版狀態Published - 2009
對外發佈
事件9th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2009 - Taipei, Taiwan, Province of China
持續時間: 8 6月 200911 6月 2009

出版系列

名字Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5574 LNCS
ISSN(列印)0302-9743
ISSN(電子)1611-3349

Conference

Conference9th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2009
國家/地區Taiwan, Province of China
城市Taipei
期間8/06/0911/06/09

指紋

深入研究「Dynamically maintaining duplicate-insensitive and time-decayed sum using time-decaying bloom filter」主題。共同形成了獨特的指紋。

引用此