On distributing symmetric streaming computations

ACM Transactions on Algorithms

Volumn 6, Issue 4, 2010, Pages

  Feldman, Jon ^a   Muthukrishnan, S ^a   Sidiropoulos, Anastasios ^b   Stein, Cliff ^c   Svitkina, Zoya ^d  

^a GOOGLE INC   (United States)

^b TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^c Columbia University ^*  (United States)

^d UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Distributed; Distributed computations; Mapreduce; Streaming; Symmetric

Indexed keywords

DISTRIBUTED; DISTRIBUTED COMPUTATIONS; MAP-REDUCE; STREAMING; SYMMETRIC;

DISTRIBUTED COMPUTER SYSTEMS;

ALGORITHMS;

EID: 77956508106     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1824777.1824786     Document Type: Conference Paper

References (18)

1. ALON, N., MATIAS, Y., AND SZEGEDY, M. 1996. The space complexity of approximating the frequency moments. In Proceedings of the Symposium on Theory of Computing, 20-29
2. BABAI, L., GAL, A., KlMMEL, P., AND LOKAM, S. 1996. Simultaneous messages and communication. Tech. rep., University of Chicago
3. BABAI, L. AND KIMMEL, P. G. 1997. Randomized simultaneous messages: Solution of a problem of Yao in communication complexity. In Computational Complexity. 239
4. BIALECKI, A., CAFARELLA, M., CUTTING, D., AND O'MALLEY, O. 2005. Hadoop: A framework for running applications on large clusters built of commodity hardware. http://lucene.apache.org/hadoop/.
5. BRODER, A., CHARIKAR, M., FRIEZE, A., AND MITZENMACHER, M. 2000. Min-Wise independent permutations. J. Comput. Syst. Sci. 60, 3, 630-659.
6. DATAR, M.AND MUTHUKRISHNAN, S. 2002. Estimating rarity and similarity over data stream windows. In Proceedings of the Annual European Symposium on Algorithms (ESA). 323-334.
7. DEAN, J. AND GHEMAWAT, S. 2004. MapReduce: Simplified data processing on large clusters. In Proceedings of the 6th Symposium on Operating System Design and Implementation (OSDI'04).
8. GREENLAW, R., HOOVER, H.J., AND RUZZO, W. L. 1995. Limits to Parallel Computation: P-Completeness Theory. Oxford University Press.
9. HENZINGER, M., RAGHAVAN, P., AND RAJAGOPALAN, S. 1998. Computing on data streams. Tech. note 1998-011, Digital Systems Research Center, Palo Alto, CA.
10. INDYK, P. 2006. Stable distributions, pseudorandom generators, embeddings, and data stream computation. J. ACM, 307-323.
11. MCGREGOR, A. Open problems in data streams research. http://www.cse.iitk. ac.in/users/sganguly/data-stream-probs.pdf.
12. MUTHUKRISHNAN, S. 2005. Data streams: Algorithms and applications. In Foundations and Trends in Theoretical Computer Science.
13. NAOR, J. AND NAOR, M. 1993. Small-Bias probability spaces: Efficient constructions and applications. SIAMJ. Comput. 22, 4, 838-856.
14. NATH, S., GIBBONS, P.B., SESHAN, S., AND ANDERSON, Z. 2008. Synopsis diffusion for robust aggregation in sensor networks. ACM Trans. Sensor. Netw. 4, 2, 1-40.
15. NEWMAN, I. AND SZEGEDY, M. 1996. Public vs. private coin flips in one round communication games (extended abstract). In Proceedings ofthe Annual ACM Symposium on Theory ofComputing (STOC). 561-570.
16. PIKE, R., DORWARD, S., GRIESEMER, R., AND QUINLAN, S. 2005. Interpreting the data: Parallel analysis with sawzall. Sci. Program. J. 13, 4, 227-298.
17. PUDLAK, P., RODL, V., AND SGALL, J. 1994. Boolean circuits, tensor ranks and communication complexity. SIAM J. Comput. 26, 3, 605-633.
18. SAVITCH, W. 1973. Maze recognizing automata and nondeterministic tape complexity. J. Comput. Syst. Sci. 7, 4, 389-403.