SpaceSaving: An Optimal Algorithm for Frequency Estimation and Frequent Items in the Bounded-Deletion Model (vol 15, pg 1215, 2022)

PROCEEDINGS OF THE VLDB ENDOWMENT(2023)

引用 0|浏览2
暂无评分
摘要
This errata article points out an implicit assumption in the work of four of us published in VLDB 2022. The SpaceSaving +/- algorithm in bounded deletion data stream presented in the paper implicitly assumed deletions happen after all insertions. When insertions and deletions are interleaved, that algorithm may severely underestimate item's frequency. We first illustrate this phenomenon by an example and then present a modified algorithm with minor changes to allow interleaving between insertions and deletions. We also include a pointer to a full analysis of the new algorithms.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要