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

We present deterministic sub-linear space algorithms for a number of problems over update data streams, including, estimating frequencies of items and ranges, finding approximate frequent items and approximate φ-quantiles, estimating inner-products, constructing nearoptimal B-bucket histograms and estimating entropy. We also present new lower bound results for several problems over update data streams.

• Type: Conference
• Year: 2007
• Where: ESCAPE
• Authors: Sumit Ganguly, Anirban Majumder
• Keywords: Algorithms, Approximate Frequent Items, ESCAPE 2007, Estimating, Update Data Streams