Database Paper Browser

Back to papers

Sketching via Hashing: From Heavy Hitters to Compressive Sensing to Sparse Fourier Transform

Summary: Survey of hashing-based sketching primitives that enable single-pass, sublinear-space approximation of counts and heavy hitters in data streams. Explores how these hash-sketch variants unify and propel algorithmic advances in compressive sensing, dimensionality reduction, and sparse FFT. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1600
Venue
PODS
Year
2013
Pagerank
4.4039656e-05
Overall Rank
9,060 | 36.98%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,901 Streaming Algorithms with Few State Changes 2024 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
597 Computing Iceberg Queries Efficiently 1998 VLDB 0.00019475592
781 Spectral Bloom Filters 2003 SIGMOD 0.00016741046
865 What’s Hot and What’s Not: Tracking Most Frequent Items Dynamically 2003 PODS 0.00015808172
Previous Page 1 / 1 Next

Semantically Similar Papers