A general method for estimating correlated aggregates over a data stream

DOI10.1007/s00453-014-9917-1zbMath1322.68068OpenAlexW2074281600WikidataQ60148565 ScholiaQ60148565MaRDI QIDQ747615

David P. Woodruff, Srikanta Tirthapura

Publication date: 19 October 2015

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1153&context=ece_pubs

zbMATH Keywords

algorithmslower boundsfrequency momentscorrelated aggregatesdata stream mining

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05) Information storage and retrieval of data (68P20)

Cites Work

• Unnamed Item
• Unnamed Item
• Distributed streams algorithms for sliding windows
• Probabilistic counting algorithms for data base applications
• On data structures and asymmetric communication complexity
• The space complexity of approximating the frequency moments
• Finding frequent items in data streams
• Sketching asynchronous data streams over sliding windows
• Effective Computations on Sliding Windows
• Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window
• Optimal approximations of the frequency moments of data streams
• Time-decaying Sketches for Robust Aggregation of Sensor Data
• A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
• Maintaining Stream Statistics over Sliding Windows
• How to Catch L 2-Heavy-Hitters on Sliding Windows
• Sketching asynchronous streams over a sliding window
• Time-decaying sketches for sensor data aggregation
• Streaming Algorithms via Precision Sampling