A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows

2018
*
International Workshop on Approximation Algorithms for Combinatorial Optimization
*

We study the distinct elements and p -heavy hitters problems in the sliding window model, where only the most recent n elements in the data stream form the underlying set. We first introduce the composable histogram, a simple twist on the exponential (Datar et al., SODA 2002) and smooth histograms (Braverman and Ostrovsky, FOCS 2007) that may be of independent interest. We then show that the composable histogram along with a careful combination of existing techniques to track either the

doi:10.4230/lipics.approx-random.2018.7
dblp:conf/approx/BravermanGLWZ18
fatcat:hksvwcry7nbcjezefncnxqvzqa