Approximating frequent items in asynchronous data stream over a sliding window
From MaRDI portal
Publication:1736485
DOI10.3390/A4030200zbMATH Open1461.68260OpenAlexW2027826195WikidataQ58062912 ScholiaQ58062912MaRDI QIDQ1736485FDOQ1736485
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)
Full work available at URL: https://doi.org/10.3390/a4030200
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
Online algorithms; streaming algorithms (68W27) Data structures (68P05) Approximation algorithms (68W25)
Cites Work
- Finding repeated elements
- Data streams: algorithms and applications.
- Maintaining Stream Statistics over Sliding Windows
- Title not available (Why is that?)
- De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
- 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
- Approximating frequent items in asynchronous data stream over a sliding window
- Sketching asynchronous streams over a sliding window
- Finding frequent items over sliding windows with constant update time
Cited In (4)
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)
