Advanced Search

Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform

Research and Teaching Output of the MIT Community

Show simple item record Indyk, Piotr 2014-05-09T14:38:23Z 2014-05-09T14:38:23Z 2013-06
dc.identifier.isbn 9781450320665
dc.description.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. en_US
dc.language.iso en_US
dc.publisher Association for Computing Machinery en_US
dc.relation.isversionof en_US
dc.rights Creative Commons Attribution-Noncommercial-Share Alike en_US
dc.rights.uri en_US
dc.source MIT web domain en_US
dc.title Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform en_US
dc.type Article en_US
dc.identifier.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. en_US
dc.contributor.department Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science en_US
dc.contributor.mitauthor Indyk, Piotr en_US
dc.relation.journal Proceedings of the 32nd symposium on Principles of Database Systems - PODS '13 en_US
dc.identifier.mitlicense OPEN_ACCESS_POLICY en_US
dc.eprint.version Author's final manuscript en_US
dc.type.uri en_US
eprint.status en_US
dspace.orderedauthors Indyk, Piotr en_US

Files in this item

Name Size Format
Downloadable Full Text - PDF

This item appears in the following Collection(s)

Show simple item record

Creative Commons Attribution-Noncommercial-Share Alike Except where otherwise noted, this item's license is described as Creative Commons Attribution-Noncommercial-Share Alike
Open Access