A Universal Sketch for Estimating Heavy Hitters and Per-Element Frequency Moments in Data Streams with Bounded Deletions
Liang Zheng, Qingjun Xiao, Xuyuan Cai
Abstract
In the field of data stream processing, there are two prevalent models, i.e., insertion-only, and turnstile models. Most previous works were proposed for the insertion-only model, which assumes new elements arrive continuously as a stream, and neglects the possibilities of removing existing elements. In this paper, we make a bounded deletion assumption, putting a constraint on the number of deletions allowed. For such a turnstile stream, we focus on a new problem of universal measurement that estimates multiple kinds of statistical metrics simultaneously using limited memory and in an online fashion, including per-element frequency, heavy hitters, frequency moments, and frequency distribution. There are two key challenges for processing a turnstile stream with bounded deletions. Firstly, most previous methods for detecting heavy hitters cannot ensure a bounded detection error when there are deletion events. Secondly, there is still no prior work to estimate the per-element frequency moments under turnstile model, especially in an online fashion. In this paper, we address the former challenge by proposing a Removable Augmented Sketch, and address the latter by a Removable Universal Sketch, enhanced with an Online Moment Estimator. In addition, we improve the accuracy of frequency estimation by a compressed counter design, which can halve the memory cost of a frequency counter and support addition/minus operations. Our experiments show that our solution outperforms other algorithms by 16% 69% in F1 Score of heavy hitter detection, and improves the throughput of frequency moment estimation by 3.0x10 4 times.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get b4868624-e528-44e6-b4df-1f09775755bfRelated papers
- Adversarial Robustness on Insertion-Deletion StreamsElena Gribelyuk, Honghao Lin, David P. Woodruff, Huacheng Yu et al.STOC 2026 · 2 citations
- Harmonic Decomposition in Data SketchesDingyu WangSTOC 2025 · 1 citation
- Adversarially Robust Dense-Sparse Tradeoffs via Heavy-HittersDavid P. Woodruff, Samson ZhouNeurIPS 2024 · 9 citations
- Universal Online Sketch for Tracking Heavy Hitters and Estimating Moments of Data StreamsQingjun Xiao, Zhiying Tang, Shigang ChenINFOCOM 2020 · 30 citations
- DHS: Adaptive Memory Layout Organization of Sketch Slots for Fast and Accurate Data Stream ProcessingBohan Zhao, Xiang Li, Boyu Tian, Zhiyu Mei et al.KDD 2021 · 47 citations
