Cardinality estimation using Gumbel distribution
From MaRDI portal
Cites work
- A statistical analysis of probabilistic counting algorithms
- An optimal cardinality estimation algorithm based on order statistics and its full analysis
- Data streams as random permutations: the distinct element problem
- Distinct counting with a self-learning bitmap
- Efficient estimation of the cardinality of large data sets
- scientific article; zbMATH DE number 1256715 (Why is no real title available?)
- scientific article; zbMATH DE number 2019620 (Why is no real title available?)
- scientific article; zbMATH DE number 3017610 (Why is no real title available?)
- scientific article; zbMATH DE number 2119719 (Why is no real title available?)
- Information theoretic limits of cardinality estimation: Fisher meets Shannon
- LogLog counting of large cardinalities (extended abstract)
- Optimal bounds for Johnson-Lindenstrauss transforms and streaming problems with sub-constant error
- Optimal space lower bounds for all frequency moments
- Optimal streaming and tracking distinct elements with high probability
- Order statistics and estimating cardinalities of massive data sets
- Probabilistic counting algorithms for data base applications
This page was built for publication: Cardinality estimation using Gumbel distribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969602)