Efficient Summing over Sliding Windows

DOI10.4230/LIPICS.SWAT.2016.11MaRDI QIDQ5369513zbMATH OpenOpenAlexFDO

Authors Ran Ben-Basat, Gil Einziger, Roy Friedman, Yaron Kassner

Publication date 17 October 2017

Full work available at URL https://arxiv.org/abs/1604.02450

Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Abstract: This paper considers the problem of maintaining statistic aggregates over the last W elements of a data stream. First, the problem of counting the number of 1's in the last W bits of a binary stream is considered. A lower bound of {Omega}(1/{epsilon} + log W) memory bits for W{epsilon}-additive approximations is derived. This is followed by an algorithm whose memory consumption is O(1/{epsilon} + log W) bits, indicating that the algorithm is optimal and that the bound is tight. Next, the more general problem of maintaining a sum of the last W integers, each in the range of {0,1,...,R}, is addressed. The paper shows that approximating the sum within an additive error of RW{epsilon} can also be done using {Theta}(1/{epsilon} + log W) bits for {epsilon}={Omega}(1/W). For {epsilon}=o(1/W), we present a succinct algorithm which uses B(1 + o(1)) bits, where B={Theta}(Wlog(1/W{epsilon})) is the derived lower bound. We show that all lower bounds generalize to randomized algorithms as well. All algorithms process new elements and answer queries in O(1) worst-case time.

Recommendations

Cited in

(13)

This page was built for publication: Efficient Summing over Sliding Windows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5369513)