Estimating hybrid frequency moments of data streams: Extended abstract

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5059 LNCS, Issue , 2008, Pages 55-66

  Ganguly, Sumit ^a   Bansal, Mohit ^a   Dube, Shruti ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMICS; DATASTREAM (CO); INTERNATIONAL (CO); TWO-DIMENSIONAL (2-D) ARRAY; TWO-DIMENSIONAL (2D);

NEODYMIUM; TELECOMMUNICATION NETWORKS;

TWO DIMENSIONAL;

EID: 45849091148     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69311-6_9     Document Type: Conference Paper

References (16)

1. Alón, N., Matias, Y., Szegedy, M.: The space complexity of approximating frequency moments. J. Comp. Sys. and Sc. 58(1), 137-147 (1998)
2. Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. In: Proceedings of ACM Symposium on Theory of Computing, Princeton, NJ, pp. 209-218 (2002)
3. Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D., Trevisan, L.: Counting Distinct Elements in a Data Stream. In: Rolim, J.D.P., Vadhan, S.P. (eds.) RANDOM 2002. LNCS, vol. 2483. Springer, Heidelberg (2002)
4. Bhuvanagiri, L., Ganguly, S.: Estimating Entropy over Data Streams. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 148-159. Springer, Heidelberg (2006)
5. Chakrabarti, A., Khot, S., Sun, X.: Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness. In: Proceedings of 18th IEEE Conference on Computational Complexity, pp. 107-117. IEEE Computer Society, Los Alamitos (2003)
6. Cormode, G., Muthukrishnan, S.: Space Efficient Mining of Multigraph Streams. In: Proceedings of the 24th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, ACM 2005, pp. 271-282 (2005)
7. Flajolet, P., Martin, G.N.: Probabilistic Counting Algorithms for Database Applications. J. Comp. Sys. and Sc. 31(2), 182-209 (1985)
8. Ganguly, S.: Counting Distinct Items over Update Streams. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 505-514. Springer, Heidelberg (2005)
9. Ganguly, S., Cormode, G.: On Estimating Frequency Moments of Data Streams. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol. 4627, pp. 479-493. Springer, Heidelberg (2007)
10. Gibbons, P.B., Tirthapura, S.: Estimating simple functions on the union of data streams. In: Proceedings of the 13th ACM Symposium on Parallel Algorithms and Architectures, pp. 281-291. ACM, New York (2001)
11. Indyk, P.: Stable Distributions, Pseudo Random Generators, Embeddings and Data Stream Computation. In: Procedings of the 41st Symposium on Foundations of Computer Science (FOCS), pp. 189-197. IEEE Computer Society, Los Alamitos (2000)
12. Indyk, P., Woodruff, D.: Optimal Approximations of the Frequency Moments. In: Proceedings of the 37th ACM Symposium on Theory of Computing, 2005 (STOC), pp. 202-208 (2005)
13. Li, P.: Very Sparse Stable Random Projections, Estimators and Tail Bounds for Stable Random Projections (manuscript, 2006)
14. McGregor, A.: Open Problems In Data Streams And Related Topics: IITK Workshop On Algorithms For Data Streams (2006), http://www.cse.iitk.ac.in/users/ sganguly/openproblems.pdf
15. Nolan, J.P.: Stable Distributions, Ch.1 (2006), http://academic2. american.edu/~jpnolan
16. Woodruff, D.P.: Optimal space lower bounds for all frequency moments. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 167-175. SIAM, Philadelphia (2004)