Dynamically computing approximate frequency counts in sliding window over data stream

DOI10.1007/BF02831748MaRDI QIDQ5291160zbMATH OpenOpenAlexFDO

Authors Guoliang Nie, Zheng Ding Lu

Publication date 9 May 2006

Published in Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02831748

zbMATH Keywords

approximation algorithms

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 2119721
• Finding frequent items over sliding windows with constant update time
• Maintaining Stream Statistics over Sliding Windows
• Mining approximate frequent itemsets over data streams using window sliding techniques
• Distributed streams algorithms for sliding windows

Cites work

• Distributed streams algorithms for sliding windows
• Finding repeated elements
• scientific article; zbMATH DE number 1947405 (Why is no real title available?)
• scientific article; zbMATH DE number 2119721 (Why is no real title available?)

Cited in

(4)

• Top-\(k\) frequent items and item frequency tracking over sliding windows of any size
• Deterministically Estimating Data Stream Frequencies
• scientific article; zbMATH DE number 2166690 (Why is no real title available?)
• Finding frequent items over sliding windows with constant update time

This page was built for publication: Dynamically computing approximate frequency counts in sliding window over data stream

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