Order statistics and estimating cardinalities of massive data sets
From MaRDI portal
Publication:5485331
zbMATH Open1104.68032MaRDI QIDQ5485331FDOQ5485331
Authors: F. Giroire
Publication date: 29 August 2006
Recommendations
- Order statistics and estimating cardinalities of massive data sets
- An optimal cardinality estimation algorithm based on order statistics and its full analysis
- A statistical analysis of probabilistic counting algorithms
- LogLog counting of large cardinalities (extended abstract)
- scientific article; zbMATH DE number 5763313
Cited In (13)
- Data streams as random permutations: the distinct element problem
- A result in order statistics related to probabilistic counting
- Title not available (Why is that?)
- A statistical analysis of probabilistic counting algorithms
- Loglog counting for IP traffic
- A Modular CDF Approach for the Approximation of Percentiles
- Title not available (Why is that?)
- Two improved range-efficient algorithms for \(F_0\) estimation
- Order statistics and estimating cardinalities of massive data sets
- A framework for estimating stream expression cardinalities
- LogLog counting of large cardinalities (extended abstract)
- Efficient estimation of the cardinality of large data sets
- An optimal cardinality estimation algorithm based on order statistics and its full analysis
This page was built for publication: Order statistics and estimating cardinalities of massive data sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5485331)