Estimating small frequency moments of data stream: a characteristic function approach

Estimating small frequency moments of data stream: a characteristic function approach (2010)

Cached

Download Links

[www.cse.iitk.ac.in]

by Sumit Ganguly , Purushottam Kar

BibTeX

@MISC{Ganguly10estimatingsmall,
    author = {Sumit Ganguly and Purushottam Kar},
    title = {Estimating small frequency moments of data stream: a characteristic function approach},
    year = {2010}
}

Bookmark

OpenURL

Abstract

We consider the problem of estimating the first moment of a data stream defined as

Citations

570	The space complexity of approximating the frequency moments - Alon, Matias, et al. - 1999
284	Probabilistic Counting Algorithms for Data Base - Flajolet, Martin - 1985
205	Stable distributions, pseudorandom generators, embeddings, and data stream computation - Indyk
162	Pseudorandom generators for space-bounded computations - Nisan - 1990
118	An information statistics approach to data stream and communication complexity - Bar-Yossef, Jayram, et al.
71	Estimating simple functions on the union of data streams - Gibbons, Tirthapura - 2001
62	Near-optimal lower bounds on the multi-party communication complexity of set-disjointness - Chakrabarti, Khot, et al. - 2003
46	Space lower bounds for distance approximation in the data stream model - Saks, Sun - 2002
42	Optimal space lower bounds for all frequency moments - Woodruff - 2004
17	Fast mining of massive tabular data via approximate distance computations - Cormode, Indyk, et al. - 2002
10	On the exact space complexity of sketching and streaming small norms - Kane, Nelson, et al. - 2010
8	Fast, small-space algorithms for approximate histogram maintenance - Gilbert, Guha, et al. - 2002
2	Estimators and tail bounds for dimension reduction in ℓ - Li - 2008
1	An Approximate - Feigenbaum, Kannan, et al. - 1999