Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
From MaRDI portal
Recommendations
- Range counting over multidimensional data streams
- Range counting over multidimensional data streams
- scientific article; zbMATH DE number 2019620
- Algorithms and Computation
- Counting distinct items over update streams
- On the I/O complexity of dynamic distinct counting
- scientific article; zbMATH DE number 2081109
- Database Theory - ICDT 2005
- On Finding Frequent Elements in a Data Stream
- Boosting distinct random sampling for basic counting on the union of distributed streams
Cited in
(17)- Two improved range-efficient algorithms for \(F_0\) estimation
- Counting distinct items over update streams
- Data streams as random permutations: the distinct element problem
- Estimating the range of a function in an online setting
- scientific article; zbMATH DE number 2019620 (Why is no real title available?)
- Streaming techniques and data aggregation in networks of tiny artefacts
- Boosting distinct random sampling for basic counting on the union of distributed streams
- scientific article; zbMATH DE number 7278047 (Why is no real title available?)
- An improved interactive streaming algorithm for the distinct elements problem
- On density, threshold and emptiness queries for intervals in the streaming model
- Beating CountSketch for heavy hitters in insertion streams
- Two Improved Range-Efficient Algorithms for F 0 Estimation
- Algorithms and Computation
- scientific article; zbMATH DE number 7758337 (Why is no real title available?)
- Model counting meets \(F_0\) estimation
- Improved streaming algorithm for the Klee's measure problem and generalizations
- Efficient transformations for Klee's measure problem in the streaming model
This page was built for publication: Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5386204)
