Efficient estimation of the cardinality of large data sets

zbMATH Open1191.68378arXivmath/0701347MaRDI QIDQ3575017FDOQ3575017

Authors: Philippe Chassaing, L. Gerin 

Publication date: 5 July 2010

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

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

zbMATH Keywords

approximate countingcardinalitylarge multiset

Mathematics Subject Classification ID

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

Cited In (8)

• Approximating the size of a radio network in beeping model
• Title not available (Why is that?)
• Give me some slack: efficient network measurements
• A unified scheme for generalizing cardinality estimators to sum aggregation
• Title not available (Why is that?)
• Estimating the size of a hidden finite set: large-sample behavior of estimators
• Order statistics and estimating cardinalities of massive data sets
• Fast size approximation of a radio network in beeping model

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)