Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
From MaRDI portal
Publication:5386204
DOI10.1137/050643672zbMath1139.68025OpenAlexW2133662033WikidataQ60148599 ScholiaQ60148599MaRDI QIDQ5386204
No author found.
Publication date: 22 April 2008
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050643672
Analysis of algorithms (68W40) Database theory (68P15) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items
Efficient transformations for Klee's measure problem in the streaming model, Unnamed Item, Streaming techniques and data aggregation in networks of tiny artefacts, Boosting distinct random sampling for basic counting on the union of distributed streams, Unnamed Item
