Streaming algorithms are algorithms for processing large data streams, using only a limited amount of memory. Classical streaming algorithms operate under the assumption that the input stream is fixed in advance. Recently, there is a growing interest in studying streaming algorithms that provide provable guarantees even when the input stream is chosen by an adaptive adversary. Such streaming algorithms are said to be {\em adversarially-robust}. We propose a novel framework for adversarial streaming that hybrids two recently suggested frameworks by Hassidim et al. (2020) and by Woodruff and Zhou (2021). These recently suggested frameworks rely on very different ideas, each with its own strengths and weaknesses. We combine these two frameworks (in a non-trivial way) into a single hybrid framework that gains from both approaches to obtain superior performances for turnstile streams.
翻译:流动算法是处理大型数据流的算法,仅使用有限的内存量。 经典流算法在假定输入流是预先固定的前提下运作。 最近,人们越来越有兴趣研究流算法,这种流算法即使输入流是由适应性对手选择的,也提供了可行的保证。 据说这种流算法是 prem 对抗- robust}。 我们提出了一个新的对抗性流法框架,即由Hassidim et al. (202020) 和 Woodruff 和 Zhou (2021) 最近提出的两个框架混合起来。 这些最近提出的框架依靠非常不同的想法,每个框架都有自己的长处和短处。 我们将这两个框架(非三元方式)合并为一个单一的混合框架,从这两种方法中得益,以获得对旋转流流的优性能。