IEEE Software · 2011 · 41 citations · 8 references
ComputingComputer ScienceData MiningData StructuresData ModelingData ProcessingData SketchesItem CountingSketching AlgorithmsSketching Data Structures
Faced with handling multiple large data sets in modern data-processing settings, researchers have proposed sketch data structures that capture salient properties while occupying little memory and that update or probe quickly. In particular, the Count-Min sketch has proven effective for a variety of applications. It concurrently tracks many item counts with surprisingly strong accuracy.
8
V. J. Rayward‐Smith, Thomas H. Cormen, Charles E. Leiserson et al. · Journal of the Operational Research Society · 1991 · 17K citations
Sparse Recovery Using Sparse Matrices
Anna C. Gilbert, Piotr Indyk · Proceedings of the IEEE · 2010 · 417 citations · Full text
Even strongly universal hashing is pretty fast
Mikkel Thorup · Symposium on Discrete Algorithms · 2000 · 56 citations