Two improved range-efficient algorithms for F₀ estimation
From MaRDI portal
Two improved range-efficient algorithms for \(F 0\) estimation
Recommendations
- Two Improved Range-Efficient Algorithms for F 0 Estimation
- Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
- Optimal approximations of the frequency moments of data streams
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- scientific article; zbMATH DE number 2019620
Cites work
- scientific article; zbMATH DE number 2019620 (Why is no real title available?)
- scientific article; zbMATH DE number 2119719 (Why is no real title available?)
- Algorithms - ESA 2003
- Data streams: algorithms and applications.
- LogLog counting of large cardinalities (extended abstract)
- New hash functions and their use in authentication and set equality
- Order statistics and estimating cardinalities of massive data sets
- Probabilistic counting algorithms for data base applications
- The space complexity of approximating the frequency moments
Cited in
(4)
This page was built for publication: Two improved range-efficient algorithms for \(F_0\) estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007249)