A framework for estimating stream expression cardinalities

DOI10.4230/LIPICS.ICDT.2016.6MaRDI QIDQ5276185zbMATH OpenFDO

Authors Anirban Dasgupta, Kevin J. Lang, Lee Rhodes, Justin Thaler

Publication date 14 July 2017

Full work available at URL https://arxiv.org/abs/1510.01455

zbMATH Keywords

data stream algorithmsdistinct elementsmergeabilityset operationssketching

Mathematics Subject Classification ID

General topics in the theory of data (68P01) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• A statistical analysis of probabilistic counting algorithms
• Order statistics and estimating cardinalities of massive data sets
• scientific article; zbMATH DE number 2019620
• Order statistics and estimating cardinalities of massive data sets
• Data streams as random permutations: the distinct element problem

Cited in

(3)

• scientific article; zbMATH DE number 4030785 (Why is no real title available?)
• Stream sampling framework and application for frequency cap statistics
• Boosting distinct random sampling for basic counting on the union of distributed streams

This page was built for publication: A framework for estimating stream expression cardinalities

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