Approximating frequent items in asynchronous data stream over a sliding window

DOI10.3390/A4030200MaRDI QIDQ1736485zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

space complexitysliding windowfrequent itemsasynchronous data streams

Mathematics Subject Classification ID

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

Recommendations

• Approximating frequent items in asynchronous data stream over a sliding window
• Finding frequent items over sliding windows with constant update time
• An efficient algorithm for mining approximate frequent item over data streams
• A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
• Sketching asynchronous data streams over sliding windows

Cites work

• scientific article; zbMATH DE number 1947405 (Why is no real title available?)
• A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
• Approximating frequent items in asynchronous data stream over a sliding window
• Data streams: algorithms and applications.
• De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
• Finding frequent items over sliding windows with constant update time
• Finding repeated elements
• Maintaining Stream Statistics over Sliding Windows
• Maintaining significant stream statistics over sliding windows
• Sketching asynchronous streams over a sliding window
• Time-decaying sketches for robust aggregation of sensor data

Cited in

(4)

• Sketching asynchronous data streams over sliding windows
• The Frequent Items Problem in Online Streaming Under Various Performance Measures
• Approximating frequent items in asynchronous data stream over a sliding window
• The frequent items problem, under polynomial decay, in the streaming model

This page was built for publication: Approximating frequent items in asynchronous data stream over a sliding window

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