arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.16786cs.DScs.PF
收藏

弹性草图在随机稳定数据流中的表现:极限行为和近最优配置

Elastic Sketch under Random Stationary Streams: Limiting Behavior and Near-Optimal Configuration

University of Avignon(阿维尼翁大学);IIT Bombay(印度理工学院孟买分校);Meta

Younes Ben Mazziane, Vinay Kumar B. R., Othmane Marfoq

AI总结:

本文研究了弹性草图在随机稳定数据流中的性能,分析了其极限分布和内存分配优化,通过理论推导和数值模拟验证了其在实际应用中的有效性。

摘要:

Elastic-Sketch是一种基于哈希的数据结构,用于计数数据流中项目出现的次数,已实验证明其在内存-准确性权衡上优于传统方法。该算法结合了重块和轻块:重块用于维护少量动态选定项目的精确计数,而轻块通过计数-最小草图(CM)对剩余流量进行摘要。重块的动态行为由哈希函数β决定,该函数将项目哈希到m₁个桶中,并通过淘汰阈值λ控制选定项目的替换难度。本文证明了Elastic-Sketch的性能强烈依赖于数据流特征和λ的选择。由于最优参数选择依赖于未知的数据流属性,本文分析了在稳定随机数据流模型下的Elastic-Sketch表现——这一常见假设捕捉了现实负载中观察到的统计规律。形式上,随着数据流长度趋于无穷大,本文推导了计数器的极限分布和由此产生的预期计数误差的闭合表达式。这些表达式可以高效计算,使重块和CM块内存分配(通过m₁)和淘汰阈值λ的网格化调优成为可能。此外,本文进一步刻画了最优淘汰阈值的结构,大幅减少了搜索空间,并展示了该阈值如何依赖于到达分布。广泛的数值模拟验证了我们的渐近结果在有限数据流(来自Zipf分布)中的有效性。

英文摘要:

Elastic-Sketch is a hash-based data structure for counting item's appearances in a data stream, and it has been empirically shown to achieve a better memory-accuracy trade-off compared to classical methods. This algorithm combines a heavy block, which aims to maintain exact counts for a small set of dynamically elected items, with a light block that implements Count-Min Sketch (CM) for summarizing the remaining traffic. The heavy block dynamics are governed by a hash function $β$ that hashes items into $m_1$ buckets, and an eviction threshold $λ$, which controls how easily an elected item can be replaced. We show that the performance of Elastic-Sketch strongly depends on the stream characteristics and the choice of $λ$. Since optimal parameter choices depend on unknown stream properties, we analyze Elastic-Sketch under a stationary random stream model -- a common assumption that captures the statistical regularities observed in real workloads. Formally, as the stream length goes to infinity, we derive closed-form expressions for the limiting distribution of the counters and the resulting expected counting error. These expressions are efficiently computable, enabling practical grid-based tuning of the heavy and CM blocks memory split (via $m_1$) and the eviction threshold $λ$. We further characterize the structure of the optimal eviction threshold, substantially reducing the search space and showing how this threshold depends on the arrival distribution. Extensive numerical simulations validate our asymptotic results on finite streams from the Zipf distribution.

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

↑