Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Computer Science and Artificial Intelligence Lab (CSAIL)
  3. CSAIL Digital Archive
  4. CSAIL Technical Reports (July 1, 2003 - present)
  5. Optimal Approximations of the Frequency Moments

Optimal Approximations of the Frequency Moments

Thumbnail Image
Download
Name

MIT-CSAIL-TR-2004-044.ps

Size

17.64 MB

Format

PostScript

Checksum (MD5)

24499f829339d2036e1a8988441d2315

Thumbnail Image
Download
Name

MIT-CSAIL-TR-2004-044.pdf

Size

813.81 KB

Format

Adobe PDF

Checksum (MD5)

e4091cd4f42cdaafb1a81201a9ce36e0

Author(s)
Indyk, Piotr
•
Woodruff, David
Date Issued
July 2, 2004
Series/Report no.
Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
Abstract
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 stream elements.
Subjects
AI
Persistent DSpace Link
http://hdl.handle.net/1721.1/30483
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.