Dynamically Maintaining Duplicate-Insensitive and Time-Decayed Sum Using Time-Decaying Bloom Filter

Conference Paper · June 2009with4 Reads
DOI: 10.1007/978-3-642-03095-6_70 · Source: DBLP
Conference: Algorithms and Architectures for Parallel Processing, 9th International Conference, ICA3PP 2009, Taipei, Taiwan, June 8-11, 2009. Proceedings

    Abstract

    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.