Efficient estimation of the cardinality of large data sets

MaRDI QIDQ3575017zbMATH OpenFDO

Authors Philippe Chassaing, L. Gerin

Publication date 5 July 2010

Full work available at URL https://arxiv.org/abs/math/0701347, https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAG0137/0.html

zbMATH Keywords

approximate countingcardinalitylarge multiset

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Nonnumerical algorithms (68W05)

Recommendations

• Order statistics and estimating cardinalities of massive data sets
• Order statistics and estimating cardinalities of massive data sets
• LogLog counting of large cardinalities (extended abstract)
• An optimal cardinality estimation algorithm based on order statistics and its full analysis
• Probabilistic counting algorithms for data base applications

Cited in

(9)

• On an information theoretic approach to cardinality estimation (invited talk)
• scientific article; zbMATH DE number 5967674 (Why is no real title available?)
• Give me some slack: efficient network measurements
• Order statistics and estimating cardinalities of massive data sets
• scientific article; zbMATH DE number 5763313 (Why is no real title available?)
• Approximating the size of a radio network in beeping model
• Fast size approximation of a radio network in beeping model
• A unified scheme for generalizing cardinality estimators to sum aggregation
• Estimating the size of a hidden finite set: large-sample behavior of estimators

This page was built for publication: Efficient estimation of the cardinality of large data sets

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