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

快速伪随机指纹

Fast Pseudo-Random Fingerprints

Yoram Bachrach, Ely Porat

摘要:

我们提出了一种方法来指数加速计算各种指纹,如用于计算相似性和稀有性在海量数据集。这样的方法不是维护全域$[u]$的$b$项的完整流,而是仅维护流的简明指纹,并使用指纹来执行计算。近似地进行计算,并且所需的指纹大小$k$取决于期望的精度$ε$和置信度$δ$。我们的技术每个散列函数保持单个位,而不是单个整数,因此需要长度为$k = O(\frac{\ln \frac{1}δ}{ε^2})$位的指纹,而不是先前方法所需的$O(\log u \cdot \frac{\ln \frac{1}δ}{ε^2})$位。我们提出的指纹的主要优点是,而不是在$O(b \cdot k)$的时间计算$b$项流的指纹,我们可以在时间$O(b \log k)$计算它。因此,这允许指纹构建的指数加速,或者可替代地允许实现更高的准确度,同时保留计算时间。我们的方法依赖于一个特定的伪随机散列族,我们可以快速定位散列,从而产生小值。

英文摘要:

We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather then maintaining the full stream of $b$ items of a universe $[u]$, such methods only maintain a concise fingerprint of the stream, and perform computations using the fingerprints. The computations are done approximately, and the required fingerprint size $k$ depends on the desired accuracy $ε$ and confidence $δ$. Our technique maintains a single bit per hash function, rather than a single integer, thus requiring a fingerprint of length $k = O(\frac{\ln \frac{1}δ}{ε^2})$ bits, rather than $O(\log u \cdot \frac{\ln \frac{1}δ}{ε^2})$ bits required by previous approaches. The main advantage of the fingerprints we propose is that rather than computing the fingerprint of a stream of $b$ items in time of $O(b \cdot k)$, we can compute it in time $O(b \log k)$. Thus this allows an exponential speedup for the fingerprint construction, or alternatively allows achieving a much higher accuracy while preserving computation time. Our methods rely on a specific family of pseudo-random hashes for which we can quickly locate hashes resulting in small values.

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

↑