arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1502.07027cs.DS
收藏

数据流的可变性

Variability in data streams

David Felber, Rafail Ostrovsky

摘要:

我们考虑的问题,以小的相对误差跟踪一个整数函数$f(n)$定义的分布式更新流$f'(n)$。针对该问题提供最坏情况保证的现有流媒体算法假设$f(n)$是单调的;汇总分布式非单调流的空间要求有非常大的下限,通常与流的大小$n$呈线性关系。引起大空间需求的输入流是高度可变的,从一个时间步到下一个时间步进行相对较大的跳跃。然而,流在实践中经常变化缓慢。迄今为止一直缺乏的是一个框架的非单调流,承认算法的最坏情况下的性能是一样好的现有算法的单调流和优雅地降级为非单调流,因为这些流变化更快。在本文中,我们提出了这样一个框架。我们引入了一个新的流参数,“可变性”$v$,推导其定义的方式,表明它是一个自然的参数,考虑非单调流。这也是一个有用的参数。从理论的角度来看,我们可以适应现有的算法为单调流工作的非单调流,只有很小的修改,在这样的方式,他们减少到单调的情况下,当流碰巧是单调的,并在这样的方式,我们可以细化最坏情况下的通信界限从$Θ(n)$到$\tilde{O}(v)$。从一个实际的角度来看,我们证明$v$可以在实践中小,证明$v$是$O(\log f(n))$的单调流和$o(n)$的流是“近”单调或随机游动产生的。我们期望$v$对于许多其他有趣的输入类也是$o(n)$。

英文摘要:

We consider the problem of tracking with small relative error an integer function $f(n)$ defined by a distributed update stream $f'(n)$. Existing streaming algorithms with worst-case guarantees for this problem assume $f(n)$ to be monotone; there are very large lower bounds on the space requirements for summarizing a distributed non-monotonic stream, often linear in the size $n$ of the stream. Input streams that give rise to large space requirements are highly variable, making relatively large jumps from one timestep to the next. However, streams often vary slowly in practice. What has heretofore been lacking is a framework for non-monotonic streams that admits algorithms whose worst-case performance is as good as existing algorithms for monotone streams and degrades gracefully for non-monotonic streams as those streams vary more quickly. In this paper we propose such a framework. We introduce a new stream parameter, the "variability" $v$, deriving its definition in a way that shows it to be a natural parameter to consider for non-monotonic streams. It is also a useful parameter. From a theoretical perspective, we can adapt existing algorithms for monotone streams to work for non-monotonic streams, with only minor modifications, in such a way that they reduce to the monotone case when the stream happens to be monotone, and in such a way that we can refine the worst-case communication bounds from $Θ(n)$ to $\tilde{O}(v)$. From a practical perspective, we demonstrate that $v$ can be small in practice by proving that $v$ is $O(\log f(n))$ for monotone streams and $o(n)$ for streams that are "nearly" monotone or that are generated by random walks. We expect $v$ to be $o(n)$ for many other interesting input classes as well.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑