Optimal Approximations of the Frequency Moments

We give a one-pass, O~(m^{1-2/k})-space algorithm for estimating the k-th frequency moment of a data stream for any real k>2. Together with known lower bounds, this resolves the main problem left open by Alon, Matias, Szegedy, STOC'96. Our algorithm enables deletions as well as insertions of...

Full description

Bibliographic Details
Main Authors: Indyk, Piotr, Woodruff, David
Language:en_US
Published: 2004
Subjects:
AI
Online Access:http://hdl.handle.net/1721.1/6741