Taylor Polynomial Estimator for Estimating Frequency Moments

作者: Sumit Ganguly

DOI:

关键词:

摘要: We present a randomized algorithm for estimating the $p$th moment $F_p$ of frequency vector data stream in general update (turnstile) model to within multiplicative factor $1 \pm \epsilon$, $p > 2$, with high constant confidence. For $0 < \epsilon \le 1$, uses space $O( n^{1-2/p} \epsilon^{-2} + \epsilon^{-4/p} \log (n))$ words. This improves over current bound $O(n^{1-2/p} \epsilon^{-2-4/p} words by Andoni et. al. \cite{ako:arxiv10}. Our upper matches lower Li and Woodruff \cite{liwood:random13} $\epsilon = (\log (n))^{-\Omega(1)}$ \cite{anpw:icalp13} \Omega(1)$.

参考文章(19)
Yi Li, David P. Woodruff, A Tight Lower Bound for High Frequency Moment Estimation with Small Error Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. pp. 623- 638 ,(2013) , 10.1007/978-3-642-40328-6_43
Moses Charikar, Kevin Chen, Martin Farach-Colton, Finding Frequent Items in Data Streams international colloquium on automata languages and programming. ,vol. 312, pp. 693- 703 ,(2002) , 10.1016/S0304-3975(03)00400-6
Vladimir Braverman, Rafail Ostrovsky, Recursive Sketching For Frequency Moments arXiv: Data Structures and Algorithms. ,(2010)
Sumit Ganguly, Deepanjan Kesh, Chandan Saha, Practical Algorithms for Tracking Database Join Sizes Lecture Notes in Computer Science. pp. 297- 309 ,(2005) , 10.1007/11590156_24
Graham Cormode, S. Muthukrishnan, Combinatorial Algorithms for Compressed Sensing conference on information sciences and systems. pp. 198- 201 ,(2006) , 10.1109/CISS.2006.286461
Mikkel Thorup, Yin Zhang, Tabulation based 4-universal hashing with applications to second moment estimation symposium on discrete algorithms. pp. 615- 624 ,(2004) , 10.5555/982792.982884
Oren Patashnik, Donald E. Knuth, Ronald L. Graham, Concrete Mathematics: A Foundation for Computer Science ,(1994)
Chandan Saha, Deepanjan Kesh, Sumit Ganguly, Lakshminath Bhuvanagiri, Simpler algorithm for estimating frequency moments of data streams symposium on discrete algorithms. pp. 708- 713 ,(2006) , 10.5555/1109557.1109634
Ziv Bar-Yossef, T.S. Jayram, Ravi Kumar, D. Sivakumar, An information statistics approach to data stream and communication complexity foundations of computer science. ,vol. 68, pp. 209- 218 ,(2002) , 10.1016/J.JCSS.2003.11.006