DMCA
The space complexity of approximating the frequency moments (1996)
Cached
Download Links
- [www.math.tau.ac.il]
- [www.cc.gatech.edu]
- [www.cs.tau.ac.il]
- [www.math.tau.ac.il]
- [www.tau.ac.il]
- [www.tau.ac.il]
- [www.cse.unsw.edu.au]
- [www.cs.ust.hk]
- [www.cs.tau.ac.il]
- [www.mathcs.emory.edu]
- [www.math.tau.ac.il]
- [theory.stanford.edu]
- [theory.stanford.edu]
- CiteULike
- DBLP
Other Repositories/Bibliography
| Venue: | JOURNAL OF COMPUTER AND SYSTEM SCIENCES |
| Citations: | 835 - 12 self |
BibTeX
@INPROCEEDINGS{Alon96thespace,
author = {Noga Alon and Yossi Matias and Mario Szegedy},
title = {The space complexity of approximating the frequency moments},
booktitle = {JOURNAL OF COMPUTER AND SYSTEM SCIENCES},
year = {1996},
pages = {20--29},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The frequency moments of a sequence containing mi elements of type i, for 1 ≤ i ≤ n, are the numbers Fk = �n i=1 mki. We consider the space complexity of randomized algorithms that approximate the numbers Fk, when the elements of the sequence are given one by one and cannot be stored. Surprisingly, it turns out that the numbers F0, F1 and F2 can be approximated in logarithmic space, whereas the approximation of Fk for k ≥ 6 requires nΩ(1) space. Applications to data bases are mentioned as well.
