On Finding Frequent Elements in a Data Stream

DOI10.1007/978-3-540-74208-1_42MaRDI QIDQ3603495zbMATH OpenOpenAlexFDO

Authors Ravi Kumar, Rina Panigrahy

Publication date 17 February 2009

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74208-1_42

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of data (68P99)

Recommendations

• Finding frequent items in data streams
• scientific article; zbMATH DE number 2086663
• A randomized algorithm for finding frequent elements in streams using \(O(\log \log N)\) space
• Lower Bounds on Frequency Estimation of Data Streams (Extended Abstract)
• Database Theory - ICDT 2005

Cited in

(11)

• Database Theory - ICDT 2005
• Finding Frequent Elements in Non-bursty Streams
• The frequent items problem, under polynomial decay, in the streaming model
• LATIN 2004: Theoretical Informatics
• scientific article; zbMATH DE number 2086663 (Why is no real title available?)
• A randomized algorithm for finding frequent elements in streams using \(O(\log \log N)\) space
• Finding frequent items in data streams
• Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
• Finding Frequent Items in a Turnstile Data Stream
• Finding duplicates in a data stream
• Competitive analysis of maintaining frequent items of a stream

This page was built for publication: On Finding Frequent Elements in a Data Stream

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603495)