SpaceSaving$^\pm$: An Optimal Algorithm for Frequency Estimation and Frequent items in the Bounded Deletion Model

Abstract

In this paper, we propose the first deterministic algorithms to solve the frequency estimation and frequent item problems in the bounded deletion model. We establish the space lower bound for solving the deterministic frequent items problem in the bounded deletion model, and propose the Lazy SpaceSaving ± and SpaceSaving ± algorithms with optimal space bound. We develop an efficient implementation of the SpaceSaving ± algorithm that minimizes the latency of update operations using novel data structures. The experimental evaluations testify that SpaceSaving ± has accurate frequency estimations and achieves very high recall and precision across different data distributions while using minimal space. Our analysis and experiments clearly demonstrate that SpaceSaving ± provides more accurate estimations using the same space as the state of the art protocols for applications with up to 𝑙𝑜𝑔𝑈 −1 𝑙𝑜𝑔𝑈 of items deleted, where 𝑈 is the input universe size. Moreover, motivated by prior work, we propose Dyadic SpaceSaving ± , the first deterministic quantile approximation sketch in the bounded deletion model.