Approximating frequent items in asynchronous data stream over a sliding window

DOI10.3390/a4030200zbMath1461.68260OpenAlexW2027826195WikidataQ58062912 ScholiaQ58062912MaRDI QIDQ1736485

Hing-Fung Ting, Lap-Kei Lee, Ho-Leung Chan, Tak-Wah Lam

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a4030200

zbMATH Keywords

sliding windowspace complexityfrequent itemsasynchronous data streams

Mathematics Subject Classification ID

Data structures (68P05) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Finding frequent items over sliding windows with constant update time
• Finding repeated elements
• Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window
• Maintaining significant stream statistics over sliding windows
• Time-decaying Sketches for Robust Aggregation of Sensor Data
• A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
• De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
• Maintaining Stream Statistics over Sliding Windows
• Sketching asynchronous streams over a sliding window