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

DOI10.1007/S00607-018-00695-ZzbMATH Open1445.68069OpenAlexW2907142532WikidataQ128687200 ScholiaQ128687200MaRDI QIDQ783053FDOQ783053

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

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

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)

Cites Work

• An improved data stream summary: the count-min sketch and its applications
• Title not available (Why is that?)
• Jo-DPMF: differentially private matrix factorization learning through joint optimization
• Improved concentration bounds for count-sketch
• 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)