Stable distributions, pseudorandom generators, embeddings, and data stream computation

Journal of the ACM

Volumn 53, Issue 3, 2006, Pages 307-323

  Indyk, Piotr ^a,b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b NONE   (United States)

Author keywords

Data streams; Dimensionality reduction; Embeddings; Norms; Sketching

Indexed keywords

ALGORITHMS; DATA PROCESSING; NUMERICAL METHODS; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING;

DATA STREAMS; DIMENSIONALITY REDUCTION; EMBEDDINGS; NORMS; SKETCHING;

DISTRIBUTED DATABASE SYSTEMS;

EID: 33746851190     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/1147954.1147955     Document Type: Article

References (41)

1. ALON, N., MATIAS, Y., AND SZEGEDY, M. 1996. The space complexity of approximating the frequency moments. In Proceedings of the ACM Symposium on Theory of Computing, ACM, New York, 20-29.
2. AR, S., BLUM, M., CODENOTTI, B., AND GEMMELL, P. 1993. Checking approximate computation over the reals. In Proceedings of the Annual ACM Symposium on Theory of Computing, ACM, New York.
3. BERGER, B. 1997. The fourth moment method. SIAM J. Comput. 26.
4. BRINKMAN, B., AND CHARIKAR, M. 2003. On the impossibility of dimension reduction in 11. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA.
5. BRODER, A. 1998. Filtering near-duplicate documents. In Proceedings of FUN.
6. BRODER, A., GLASSMAN, S., MANASSE, M., AND ZWEIG, G. 1997. Syntactic clustering of the web. In Proceedings of the 6th International World Wide Web Conference, 391-404.
7. CHAMBERS, J. M., MALLOWS, C. L., AND STUCK, B. W. 1976. A method for simulating stable random variables. J. Amer. Statist. Assoc. 71, 340-344.
8. COHEN, E., DATAR, M., FUJIWARA, S., GIONIS, A., INDYK, P., MOTWANI, R., ULLMAN, J., AND YANG, C. 2000. Finding interesting associations without support prunning. In Proceedings of the 16th International Conference on Data Engineering (ICDE).
9. CORMODE, G. 2003. Stable distributions for stream computations: It's as easy as 0,1,2. In Proceedings of the Workshop on Management and Processing of Data Streams.
10. CORMODE, G., DATAR, M., INDYK, P., AND MUTHUKRISHNAN, S. 2002a. Comparing data streams using hamming norms. In Proceedings of the International Conference on Very Large Databases (VLDB).
11. CORMODE, G., INDYK, P., KOUDAS, N., AND MUTHUKRISHNAN, S. 2002b. Fast mining of massive tabular data via approximate distance computations. In Proceedings of the 18th International Conference on Data Engineering (ICDE).
12. CORMODE, G., AND MUTHUKRISHNAN, S. 2003. Estimating dominance norms of multiple data streams. In Proceedings of the European Symposium on Algorithms.
13. DATAR, M., GIONIS, A., INDYK, P., AND MOTWANI, R. 2002. Maintaining stream statistics over sliding windows. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, ACM, New York.
14. DATAR, M., IMMORLICA, N., INDYK, P., AND MIRROKNI, V. 2004. Locality-sensitive hashing scheme based on p-stable distributions. In Proceedings of the ACM Symposium on Computational Geometry, ACM, New York.
15. ENGEBRETSEN, L., INDYK, P., AND O'DONNELL, R. 2002. Deterministic dimensionality reduction with applications. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, ACM, New York.
16. FEIGENBAUM, J., ISHAI, Y., MALKIN, T., NISSIM, K., STRAUSS, M. J., AND WRIGHT, R. N. 2001a. Secure multiparty computation of approximations. Lecture Notes in Computer Science, vol. 2076, Springer-Verlag, New York, 927.
17. FEIGENBAUM, J., ISHAI, Y., MALKIN, T., NISSIM, K., STRAUSS, M. J., AND WRIGHT, R. N. 2001b. Secure multiparty computation of approximations, http://eprint.iacr.org/2001/024/.
18. FEIGENBAUM, J., KANNAN, S., STRAUSS, M., AND VISWANATHAN, M. 1999. An approximate 11-difference algorithm for massive data streams. In Proceedings of the Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA.
19. FIGIEL, T., LINDENSTRAUSS, J., AND MILMAN, V. D. 1977. The dimension of almost spherical sections of convex bodies. Acta Math. 139, 53-94.
20. FREIVALDS, R. 1979. Fast probabilistic algorithms. In Proceedings of the Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 74, Springer-Verlag, New York.
21. GILBERT, A., GUHA, S., KOTIDIS, Y., INDYK, P., MUTHUKRISHNAN, M., AND STRAUSS, M. 2002. In Proceedings of the Fast, small-space algorithms for approximate histogram maintenance. In Proceedings of the Annual ACM Symposium on Theory of Computing, ACM, New York.
22. HENZINGER, M., RAGHAVAN, P., AND RAJAGOPALAN, S. 1998. Computing on data streams. Technical Note 1998-011, Digital Systems Research Center, Palo Alto, CA.
23. INDYK, P. 2000. Dimensionality reduction techniques for proximity problems. In Proceedings of the Ninth ACM-SIAM Symposium on Discrete Algorithms, ACM, New York.
24. INDYK, P. 2001. Tutorial: Algorithmic applications of low-distortion geometric embeddings. In Proceedings of the Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA.
25. INDYK, P. 2004. Algorithms for dynamic geometric problems over data streams. In Proceedings of the Annual ACM Symposium on Theory of Computing, ACM, New York.
26. INDYK, P., KOUDAS, N., AND MUTHUKRISHNAN, S. 2000. Identifying representative trends in massive time series datasets using sketches. In Proceedings of the 26th International Conference on Very Large Databases (VLDB).
27. INDYK, P., AND MOTWANI, R. 1998. Approximate nearest neighbor: towards removing the curse of dimensionality. In Proceedings of the Symposium on Theory of Computing, ACM, New York.
28. INDYK, P., AND WOODRUFF, D. 2005. Optimal approximations of the frequency moments of data streams. In Proceedings of the Annual ACM Symposium on Theory of Computing, ACM, New York.
29. JOHNSON, W., AND LINDENSTRAUSS, J. 1984. Extensions of lipshitz mapping into hilbert space. Contemp. Math. 26, 189-206.
30. n. Acta Math. 149, 71-85.
31. LINDENSTRAUSS, J., AND MILMAN, V. D. 1993. The local theory of normed spaces and its applications to convexity. In Handbook of Convex Geometry, P. M. Gruber and J. M. Wills, eds Elsevier, Amsterdam, The Netherlands, 1149-1220.
32. LINIAL, N., LONDON, E., AND RABINOVICH, Y. 1994. The geometry of graphs and some of its algorithmic applications. In Proceedings of 35th Annual IEEE Symposium on Foundations a/Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 577-591.
33. MATOUŠEK, J. 2004. Collection of open problems on low-distortion embeddings of finite metric spaces. Available at http://kam.mff.cuni.cz/ ~matousek/metrop.ps.gz.
34. MAURER, A. 2003. A bound on the deviation probability for sums of non-negative random variables. J. Ineq. Pure Applied Math. 4, 1, Art. 15.
35. MUTHUKRISHNAN, S. 2003. Data streams: Algorithms and applications (invited talk at SODA'03). Available at http://athos.rutgers.edu/~muthu/stream- 1-1.ps.
36. NISAN, N. 1990. Pseudorandom generators for space-bounded computation. In Proceedings of the Annual ACM Symposium on Theory of Computing, ACM, New York, 204-212.
37. NISAN, N. 1992. RL ⊂ SC. In Proceedings of the Annual ACM Symposium on Theory of Computing, 619-623.
38. SIVAKUMAR, D. 2002. Algorithmic derandomization via complexity theory. In Proceedings of the Annual ACM Symposium on Theory of Computing, ACM, New York, 619-626.
39. THAPER, N., GUHA, S., INDYK, P., AND KOUDAS, N. 2002. Dynamic multidimensional histograms. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD), ACM, New York.
40. WASSERMAN, H., AND BLUM, M. 1997. Software reliability via run-time result checking. J. ACM.
41. ZOLOTAREV, V. 1986. One-Dimensional Stable Distributions. Vol. 65 of Translations of Mathematical Monographs, American Mathematical Society.