arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1012.4889cs.DScs.CCcs.DB
收藏

Lp采样器的紧边界、流中重复项的查找及相关问题

Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems

Hossein Jowhari, Mert Sağlam, Gábor Tardos

摘要:

在本文中,我们提出了近最佳的空间界的Lp-采样。给定对基础向量x \in R^n的坐标的更新(加法和减法)流,完美Lp采样器以概率|x_i| ^p/n输出第i个坐标。||x||在SODA 2010中,Monemizadeh和Woodruff展示了近似Lp采样器的多对数空间上界,并展示了它们的各种应用。最近Andoni,Krauthgamer和Onak改进了p \in的上界,给出了一个O(ε^{-p} log^3 n)空间ε相对误差和常数失效率的Lp-采样器[1,2].在本文中,我们给出了另一个这样的算法,对于p \in(1,2)只需要O(ε^{-p} log^2 n)空间.对于p \in(0,1),我们的空间界限是O(ε^{-1} log^2 n),而对于$p=1$的情况,我们有一个O(log(1/ε)ε^{-1} log^2 n)空间算法。我们还给出了一个O(log^2 n)位零相对误差L0采样器,改进了Frahling、Indyk和Sohler的O(log^3 n)位算法。作为我们的采样器的应用,我们给更好的上界的问题,发现重复的数据流。如果流的长度大于字母表的大小,L1采样给我们一个O(log^2 n)的空间算法,从而改进了之前Gopalan和Radhakrishnan提出的O(log^3 n)的边界。在我们工作的第二部分中,我们证明了从0,\pm 1向量采样的Omega(log^2 n)下界(在这种特殊情况下,参数p与Lp采样无关)。这与常数ε> 0时我们的采样算法的空间相匹配。我们还证明了紧空间下界的发现重复和重打击问题。我们使用从通信复杂性问题增强索引中减少的方法来获得这些下限。

英文摘要:

In this paper, we present near-optimal space bounds for Lp-samplers. Given a stream of updates (additions and subtraction) to the coordinates of an underlying vector x \in R^n, a perfect Lp sampler outputs the i-th coordinate with probability |x_i|^p/||x||_p^p. In SODA 2010, Monemizadeh and Woodruff showed polylog space upper bounds for approximate Lp-samplers and demonstrated various applications of them. Very recently, Andoni, Krauthgamer and Onak improved the upper bounds and gave a O(ε^{-p} log^3 n) space εrelative error and constant failure rate Lp-sampler for p \in [1,2]. In this work, we give another such algorithm requiring only O(ε^{-p} log^2 n) space for p \in (1,2). For p \in (0,1), our space bound is O(ε^{-1} log^2 n), while for the $p=1$ case we have an O(log(1/ε)ε^{-1} log^2 n) space algorithm. We also give a O(log^2 n) bits zero relative error L0-sampler, improving the O(log^3 n) bits algorithm due to Frahling, Indyk and Sohler. As an application of our samplers, we give better upper bounds for the problem of finding duplicates in data streams. In case the length of the stream is longer than the alphabet size, L1 sampling gives us an O(log^2 n) space algorithm, thus improving the previous O(log^3 n) bound due to Gopalan and Radhakrishnan. In the second part of our work, we prove an Omega(log^2 n) lower bound for sampling from 0, \pm 1 vectors (in this special case, the parameter p is not relevant for Lp sampling). This matches the space of our sampling algorithms for constant ε> 0. We also prove tight space lower bounds for the finding duplicates and heavy hitters problems. We obtain these lower bounds using reductions from the communication complexity problem augmented indexing.

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

↑