What's hot and what's not: tracking most frequent items dynamically

DOI10.1145/1061318.1061325zbMATH Open1539.68092MaRDI QIDQ6534367FDOQ6534367

Authors: Graham Cormode, S. Muthukrishnan 

Publication date: 21 December 2008

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Recommendations

• Efficient automatic discovery of `hot' itemsets
• Finding frequent items in data streams
• scientific article; zbMATH DE number 2086663
• New algorithms for heavy hitters in data streams (invited talk)
• Algorithms and Computation

Mathematics Subject Classification ID

Randomized algorithms (68W20) Data structures (68P05) Database theory (68P15)

Cited In (5)

• Improved lower bound for estimating the number of defective items
• Efficiently answering top-k frequent term queries in temporal-categorical range
• Optimal Dorfman group testing for symmetric distributions
• Fast identification of heavy hitters by cached and packed group testing
• Adversarially robust streaming algorithms via differential privacy

This page was built for publication: What's hot and what's not: tracking most frequent items dynamically

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