Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform
Name
Indyk_Sketching via.pdf
Size
174.22 KB
Format
Adobe PDF
Checksum (MD5)
5749032e423dfd0e3d570160be77dc3e
Author(s)
Indyk, Piotr
Date Issued
June 2013
Journal
Proceedings of the 32nd symposium on Principles of Database Systems - PODS '13
Publisher
Association for Computing Machinery
Citation
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.
Version
Author's final manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/2463664.2465217
