Space‐efficient tracking of persistent items in a massive data stream

DOI10.1002/sam.11214OpenAlexW2029811512WikidataQ60148572 ScholiaQ60148572MaRDI QIDQ4969927

Jaideep Chandrashekar, Bibudh Lahiri, Srikanta Tirthapura

Publication date: 14 October 2020

Published in: Statistical Analysis and Data Mining: The ASA Data Science Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/sam.11214

zbMATH Keywords

persistencedata streamssketcheshash-based filters

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Uses Software

• MurmurHash

Cites Work

• Unnamed Item
• Unnamed Item
• Tracking join and self-join sizes in limited storage
• Probabilistic counting algorithms for data base applications
• Finding repeated elements
• The space complexity of approximating the frequency moments
• Finding frequent items in data streams
• An improved data stream summary: the count-min sketch and its applications
• Database Theory - ICDT 2005
• Estimating Entropy and Entropy Norm on Data Streams

This page was built for publication: Space‐efficient tracking of persistent items in a massive data stream