Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform
MetadataShow full item record
Sketching via hashing is a popular and useful method for processing large data sets. Its basic idea is as follows. Suppose that we have a large multi-set of elements S=[formula], and we would like to identify the elements that occur “frequently" in S. The algorithm starts by selecting a hash function h that maps the elements into an array c[1…m]. The array entries are initialized to 0. Then, for each element a ∈ S, the algorithm increments c[h(a)]. At the end of the process, each array entry c[j] contains the count of all data elements a ∈ S mapped to j.
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Proceedings of the 32nd symposium on Principles of Database Systems - PODS '13
Association for Computing Machinery
Indyk, Piotr. “Sketching via Hashing: from heavy hitters to compressed sensing to sparse fourier transform.” in Proceedings of the 32nd Symposium on Principles of Database Systems - PODS ’13 (2013). June 22–27, 2013, New York, New York, USA. ACM. p.87-90.
Author's final manuscript