A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Deterministic Heavy Hitters with Sublinear Query Time
[article]
2018
arXiv
pre-print
This paper studies the classic problem of finding heavy hitters in the turnstile streaming model. We give the first deterministic linear sketch that has O(ϵ^-2 n ·^*(ϵ^-1)) rows and answers queries in sublinear time. The number of rows is only a factor of ^*(ϵ^-1) more than that used by the state-of-the-art algorithm prior to our paper due to Nelson, Nguyen and Woodruff (RANDOM'12). Their algorithm runs in time at least linear in the universe size n, which is highly undesirable in streaming
arXiv:1712.01971v2
fatcat:cu647vmksvfxjkkdkd6np45qfm