Optimizing the confidence bound of count-min sketches to estimate the streaming big data query results more precisely

DOI10.1007/S00607-018-00695-ZMaRDI QIDQ783053zbMATH OpenOpenAlexWikidataFDO

Authors Ruixin Guo, Erkang Xue, Feng Zhang, Gansen Zhao, Guangzhi Qu

Publication date 30 July 2020

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00607-018-00695-z

zbMATH Keywords

confidence boundcount-min sketchoptimizingprobabilistic data structurestreaming big data

Mathematics Subject Classification ID

Statistical aspects of big data and data science (62R07) Data structures (68P05)

Recommendations

• An improved data stream summary: the count-min sketch and its applications
• LATIN 2004: Theoretical Informatics
• Learned sketches for frequency estimation
• scientific article; zbMATH DE number 5763313
• A statistical analysis of probabilistic counting algorithms

Cites work

• scientific article; zbMATH DE number 3059231 (Why is no real title available?)
• An improved data stream summary: the count-min sketch and its applications
• Improved concentration bounds for count-sketch
• Jo-DPMF: differentially private matrix factorization learning through joint optimization
• The Cambridge dictionary of statistics

Cited in

(3)

• Learned sketches for frequency estimation
• Calculating Max and Min with exemplary sketch algorithm in data stream management system
• LATIN 2004: Theoretical Informatics

This page was built for publication: Optimizing the confidence bound of count-min sketches to estimate the streaming big data query results more precisely

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q783053)