Papers
Topics
Authors
Recent
Search
2000 character limit reached

BPTree: an ℓ2\ell_2 heavy hitters algorithm using constant memory

Published 2 Mar 2016 in cs.DS | (1603.00759v4)

Abstract: The task of finding heavy hitters is one of the best known and well studied problems in the area of data streams. One is given a list i1,i2,…,im∈[n]i_1,i_2,\ldots,i_m\in[n] and the goal is to identify the items among [n][n] that appear frequently in the list. In sub-polynomial space, the strongest guarantee available is the ℓ2\ell_2 guarantee, which requires finding all items that occur at least ϵ∥f∥2\epsilon\|f\|_2 times in the stream, where the vector f∈Rnf\in\mathbb{R}^n is the count histogram of the stream with iith coordinate equal to the number of times~ii appears fi:=#{j∈[m]:ij=i}f_i:=\#\{j\in[m]:i_j=i\}. The first algorithm to achieve the ℓ2\ell_2 guarantee was the CountSketch of [CCF04], which requires O(ϵ−2log⁡n)O(\epsilon^{-2}\log n) words of memory and O(log⁡n)O(\log n) update time and is known to be space-optimal if the stream allows for deletions. The recent work of [BCIW16] gave an improved algorithm for insertion-only streams, using only O(ϵ−2log⁡ϵ−1log⁡log⁡n)O(\epsilon^{-2}\log\epsilon^{-1}\log\log n) words of memory. In this work, we give an algorithm \bptree for ℓ2\ell_2 heavy hitters in insertion-only streams that achieves O(ϵ−2log⁡ϵ−1)O(\epsilon^{-2}\log\epsilon^{-1}) words of memory and O(log⁡ϵ−1)O(\log\epsilon^{-1}) update time, which is the optimal dependence on nn and mm. In addition, we describe an algorithm for tracking ∥f∥2\|f\|_2 at all times with O(ϵ−2)O(\epsilon^{-2}) memory and update time. Our analyses rely on bounding the expected supremum of a Bernoulli process involving Rademachers with limited independence, which we accomplish via a Dudley-like chaining argument that may have applications elsewhere.

Citations (58)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.