Lower bounds on frequency estimation of data streams (extended abstract)

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

Volumn 5010 LNCS, Issue , 2008, Pages 204-215

  Ganguly, Sumit ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STREAMS; LOWER BOUNDS; RANDOMIZED SPACE UPPER BOUND;

ALGORITHMS; DATA TRANSFER; MATHEMATICAL MODELS; PROBLEM SOLVING; VECTORS;

FREQUENCY ESTIMATION;

EID: 44649182825     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79709-8_22     Document Type: Conference Paper

References (15)

1. Alon, N.: Problems and results in extremal combinatorics I. Discr. Math. 273(1-3), 31-53 (2003)
2. Alon, N.: Perturbed identity matrices have high rank: proof and applications (2006), http://www.math.tau.ac.il/~nogaa/identity.pdf
3. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating frequency moments. J. Comp. Sys. and Sc. 58(1), 137-147 (1998)
4. Bose, P., Kranakis, E., Morin, P., Tang, Y.: Bounds for Frequency Estimation of Packet Streams. In: Proc. SIROCCO, pp. 33-42 (2003)
5. Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 693-703. Springer, Heidelberg (2002)
6. Cormode, G., Muthukrishnan, S.: An Improved Data Stream Summary: The Count-Min Sketch and its Applications. J. Algorithms 55(1)
7. Demaine, E.D., López-Ortiz, A., Munro, J.L: Frequency estimation of internet packet streams with limited space. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 348-360. Springer, Heidelberg (2002)
8. Flajolet, P., Martin, G.N.: Probabilistic Counting Algorithms for Database Applications. J. Comp. Sys. and Sc. 31(2), 182-209 (1985)
9. Ganguly, S., Majumder, A.: CR-precis: A Deterministic Summary Structure for Update Streams. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614. Springer, Heidelberg (2007)
10. Ganguly, S., Majumder, A.: Deterministic K-set Structure. In: Proc. ACM PODS, pp. 280-289 (2006), www.cse.iitk.ac.in/users/sganguly
11. Ganguly, S.: Distributed deterministic approximation of vector sums (November 2007) (manuscript)
12. Ganguly, S.: Lower bounds on frequency estimation of data streams. arXiv:cs/0701004v3 (February 2008)
13. Gilbert, A., Kotidis, Y., Muthukrishnan, S., Strauss, M.: How to Summarize the Universe: Dynamic Maintenance of Quantiles. In: Proc. VLDB, Hong Kong, August 2002, pp. 454-465 (2002)
14. Karp, R.M., Shenker, S., Papadimitriou, C.H.: A Simple Algorithm for Finding Frequent Elements in Streams and Bags. ACM TODS 28(1), 51-55 (2003)
15. Misra, J., Gries, D.: Finding repeated elements. Sci. Comput. Programm. 2, 143-152 (1982)