CR-precis: A Deterministic Summary Structure for Update Data Streams

DOI10.1007/978-3-540-74450-4_5zbMath1176.68249arXivcs/0609032OpenAlexW1765394157MaRDI QIDQ3611895

Anirban Majumder, Sumit Ganguly

Publication date: 3 March 2009

Published in: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0609032

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Estimating hybrid frequency moments of data streams ⋮ On Low-Risk Heavy Hitters and Sparse Recovery Schemes ⋮ Deterministic \(k\)-set structure ⋮ Finding frequent items over sliding windows with constant update time

This page was built for publication: CR-precis: A Deterministic Summary Structure for Update Data Streams