Estimating hybrid frequency moments of data streams

DOI10.1007/S10878-010-9339-1zbMath1245.68073OpenAlexW1980581387MaRDI QIDQ431931

Shruti Dube, Sumit Ganguly, Mohit Bansal

Publication date: 3 July 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9339-1

zbMATH Keywords

algorithmsrandomized algorithmsdata streamsfrequency moments

Mathematics Subject Classification ID

Data structures (68P05) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An information statistics approach to data stream and communication complexity
• Hierarchical sampling from sketches: Estimating functions over data streams
• Probabilistic counting algorithms for data base applications
• The space complexity of approximating the frequency moments
• Finding frequent items in data streams
• Optimal approximations of the frequency moments of data streams
• On Estimating Frequency Moments of Data Streams
• CR-precis: A Deterministic Summary Structure for Update Data Streams
• An improved data stream summary: the count-min sketch and its applications
• The Data Stream Space Complexity of Cascaded Norms

This page was built for publication: Estimating hybrid frequency moments of data streams