Data Sketches for Disaggregated Subset Sum and Frequent Item Estimation


We introduce and study a new data sketch for processing massive datasets. It addresses two common problems: 1) computing a sum given arbitrary filter conditions and 2) identifying the frequent items or heavy hitters in a data set. For the former, the sketch provides unbiased estimates with state of the art accuracy. It handles the challenging scenario when… (More)
DOI: 10.1145/3183713.3183759

11 Figures and Tables


  • Presentations referencing similar topics