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

DOI10.1007/s00607-018-00695-zzbMath1445.68069OpenAlexW2907142532WikidataQ128687200 ScholiaQ128687200MaRDI QIDQ783053

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

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Jo-DPMF: differentially private matrix factorization learning through joint optimization
• An improved data stream summary: the count-min sketch and its applications
• Improved Concentration Bounds for Count-Sketch

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