58(1):137–147.

Paper doi abstract bibtex

Paper doi abstract bibtex

The frequency moments of a sequence containingmielements of typei, 1⩽i⩽n, are the numbersFk=∑ni=1mki. We consider the space complexity of randomized algorithms that approximate the numbersFk, when the elements of the sequence are given one by one and cannot be stored. Surprisingly, it turns out that the numbersF0,F1, andF2can be approximated in logarithmic space, whereas the approximation ofFkfork⩾6 requiresn\$Ømega\$(1)space. Applications to data bases are mentioned as well.

@article{alonSpaceComplexityApproximating1999, title = {The {{Space Complexity}} of {{Approximating}} the {{Frequency Moments}}}, volume = {58}, issn = {00220000}, url = {http://www.sciencedirect.com/science/article/pii/S0022000097915452}, doi = {10.1006/jcss.1997.1545}, abstract = {The frequency moments of a sequence containingmielements of typei, 1⩽i⩽n, are the numbersFk=∑ni=1mki. We consider the space complexity of randomized algorithms that approximate the numbersFk, when the elements of the sequence are given one by one and cannot be stored. Surprisingly, it turns out that the numbersF0,F1, andF2can be approximated in logarithmic space, whereas the approximation ofFkfork⩾6 requiresn\$Ømega\$(1)space. Applications to data bases are mentioned as well.}, number = {1}, journaltitle = {Journal of Computer and System Sciences}, date = {1999}, pages = {137--147}, author = {Alon, Noga and Matias, Yossi and Szegedy, Mario}, file = {/home/dimitri/Nextcloud/Zotero/storage/M7Z3C5AL/Alon, Matias, Szegedy - 1999 - The Space Complexity of Approximating the Frequency Moments.pdf} }

Downloads: 0