Abstract
We define the Streaming Communication model that combines the main aspects of communication complexity and streaming. Input arrives as a stream, spread between several agents across a network. Each agent has a bounded memory, which can be updated upon receiving a new bit, or a message from another agent. We provide tight tradeoffs between the necessary resources, i.e., communication between agents and memory, for some of the canonical problems from communication complexity by proving a strong general lower bound technique. Second, we analyze the Approximate Matching problem and show that the complexity of this problem (i.e., the achievable approximation ratio) in the one-way variant of our model is strictly different both from the streaming complexity and the one-way communication complexity thereof.
- Noga Alon, Yossi Matias, and Mario Szegedy. 1999. The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58, 1 (1999), 137--147. Google Scholar
Digital Library
- Sepehr Assadi, Sanjeev Khanna, Yang Li, and Grigory Yaroslavtsev. 2016. Maximum matchings in dynamic graph streams and the simultaneous communication model. In Proceedings of the 27th ACM-SIAM Symposium on Discrete Algorithms. 1345--1364. Google Scholar
Digital Library
- László Babai, Peter Frankl, and Janos Simon. 1986. Complexity classes in communication complexity theory. In Proceedings of the 27th IEEE Foundations of Computer Science. 337--347. Google Scholar
Digital Library
- Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, and D. Sivakumar. 2004. An information statistics approach to data stream and communication complexity. J. Comput. System Sci. 68, 4 (2004), 702--732. Google Scholar
Digital Library
- Paul Beame, Martin Tompa, and Peiyuan Yan. 1990. Communication-space tradeoffs for unrestricted protocols. In Proceedings of 31st Foundations of Computer Science. 420--428. Google Scholar
Digital Library
- Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, and Stephen G. Kobourov. 2004. Tight bounds on maximal and maximum matchings. Discrete Math. 285, 1--3 (2004), 7--15.Google Scholar
Cross Ref
- Joshua E. Brody, Shiteng Chen, Periklis A. Papakonstantinou, Hao Song, and Xiaoming Sun. 2013. Space-bounded communication complexity. In Proceedings of the 4th Innovations in Theoretical Computer Science. 159--172. Google Scholar
Digital Library
- Ho-Leung Chan, Tak-Wah Lam, Lap-Kei Lee, and Hing-Fung Ting. 2011. Continuous monitoring of distributed data streams over a time-based sliding window. Algorithmica 62, 3 (2011), 1088--1111. Google Scholar
Digital Library
- Jiecao Chen and Qin Zhang. 2017. Improved algorithms for distributed entropy monitoring. Algorithmica 78, 3 (2017), 1041--1066. Google Scholar
Digital Library
- Graham Cormode and Minos N. Garofalakis. 2005. Sketching streams through the net: Distributed approximate query tracking. In Proceedings of the International Conference on Very Large Data Bases. 13--24. Google Scholar
Digital Library
- Graham Cormode, Minos N. Garofalakis, S. Muthukrishnan, and Rajeev Rastogi. 2005. Holistic aggregates in a networked world: Distributed tracking of approximate quantiles. In Proceedings of the Special Interest Group on Management of Data. 25--36. Google Scholar
Digital Library
- Graham Cormode, S. Muthukrishnan, and Ke Yi. 2008. Algorithms for distributed functional monitoring. In Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms. 1076--1085. Google Scholar
Digital Library
- Graham Cormode, S. Muthukrishnan, Ke Yi, and Qin Zhang. 2012. Continuous sampling from distributed streams. J. ACM 59, 2 (2012), 10:1--10:25. Google Scholar
Digital Library
- Graham Cormode, S. Muthukrishnan, and Wei Zhuang. 2006. What’s different: Distributed, continuous monitoring of duplicate-resilient aggregates on data streams. In Proceedings of the 22nd International Conference on Data Engineering. 57. Google Scholar
Digital Library
- Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, and Zoya Svitkina. 2006. On the complexity of processing massive, unordered, distributed data. CoRR abs/cs/0611108.Google Scholar
- Phillip B. Gibbons and Srikanta Tirthapura. 2001. Estimating simple functions on the union of data streams. In Proceedings of the 13th ACM Symposium on Parallel Algorithms and Architectures. 281--291. Google Scholar
Digital Library
- Phillip B. Gibbons and Srikanta Tirthapura. 2002. Distributed streams algorithms for sliding windows. In Proceedings of the 14th ACM Symposium on Parallel Algorithms and Architectures. 63--72. Google Scholar
Digital Library
- Ashish Goel, Michael Kapralov, and Sanjeev Khanna. 2012. On the communication and streaming complexity of maximum bipartite matching. In Proceedings of the 23rd ACM-SIAM Symposium on Discrete Algorithms. 468--485. Google Scholar
Digital Library
- Zengfeng Huang, Ke Yi, and Qin Zhang. 2012. Randomized algorithms for tracking distributed count, frequencies, and ranks. In Proceedings of the 31st Symposium on Principles of Database Systems. 295--306. Google Scholar
Digital Library
- Russell Impagliazzo and Ryan Williams. 2010. Communication complexity with synchronized clocks. In Proceedings of the 25th IEEE Conference on Computational Complexity. 259--269. Google Scholar
Digital Library
- Michael Kapralov. 2013. Better bounds for matchings in the streaming model. In Proceedings of the 24th ACM-SIAM Symposium on Discrete Algorithms. 1679--1697. Google Scholar
Digital Library
- Michael Kapralov, Sanjeev Khanna, and Madhu Sudan. 2014. Approximating matching size from random streams. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms. 734--751. Google Scholar
Digital Library
- Christian Konrad. 2015. Maximum matching in turnstile streams. In Proceedings of 23rd European Symposium on Algorithms. 840--852.Google Scholar
Cross Ref
- Eyal Kushilevitz and Noam Nisan. 1997. Communication Complexity. Cambridge University Press, New York, NY. Google Scholar
Digital Library
- Tak Wah Lam, Prasoon Tiwari, and Martin Tompa. 1992. Trade-offs between communication and space. J. Comput. System Sci. 45, 3 (1992), 296--315. Google Scholar
Digital Library
- Yi Li, Huy L. Nguyen, and David P. Woodruff. 2014. Turnstile streaming algorithms might as well be linear sketches. In Proceedings of the 46th ACM Symposium on Theory of Computing. 174--183. Google Scholar
Digital Library
- Zhenming Liu, Bozidar Radunovic, and Milan Vojnovic. 2012. Continuous distributed counting for non-monotonic streams. In Proceedings of the 31st ACM Symposium on Principles of Database Systems. 307--318. Google Scholar
Digital Library
- Frédéric Magniez, Claire Mathieu, and Ashwin Nayak. 2014. Recognizing well-parenthesized expressions in the streaming model. SIAM J. Comput. 43, 6 (2014), 1880--1905.Google Scholar
Cross Ref
- S. Muthukrishnan. 2005. Data streams: Algorithms and applications. Found. Trends Theoret. Comput. Sci. 2, 1 (2005), 117--236. Google Scholar
Digital Library
- David P. Woodruff and Qin Zhang. 2012. Tight bounds for distributed functional monitoring. In Proceedings of the 44th ACM Symposium on Theory of Computing. 941--960. Google Scholar
Digital Library
- Andrew Chi-Chih Yao. 1979. Some complexity questions related to distributive computing. In Proceedings of the 11th ACM Symposium on Theory of Computing. 209--213. Google Scholar
Digital Library
- Ke Yi and Qin Zhang. 2013. Optimal tracking of distributed heavy hitters and quantiles. Algorithmica 65, 1 (2013), 206--223. Google Scholar
Digital Library
Index Terms
Streaming Communication Protocols
Recommendations
Amortized Communication Complexity
In this work we study the direct-sum problem with respect to communication complexity: Consider a relation $f$ defined over $\{0,1\}^{n} \times \{0,1\}^{n}$. Can the communication complexity of simultaneously computing $f$ on $\cal l$ instances $(x_1,...
Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem
PODS '17: Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsWe study the classic set cover problem in the streaming model: the sets that comprise the instance are revealed one by one in a stream and the goal is to solve the problem by making one or few passes over the stream while maintaining a sublinear space o(...
Approximating Semi-matchings in Streaming and in Two-Party Communication
We study the streaming complexity and communication complexity of approximating unweighted semi-matchings. A semi-matching in a bipartite graph G = (A, B, E) with n = |A| is a subset of edges S⊆E that matches all A vertices to B vertices with the goal ...






Comments