Maintaining time-decaying stream aggregates

DOI10.1016/J.JALGOR.2005.01.006MaRDI QIDQ5491458zbMATH OpenOpenAlexFDO

Authors Edith Cohen, M. Strauss

Publication date 5 October 2006

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgor.2005.01.006

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Theoretical Computer Science
• Improved algorithms for polynomial-time decay and time-decay with additive error
• Time-decaying sketches for sensor data aggregation
• The frequent items problem, under polynomial decay, in the streaming model
• Time-decaying sketches for robust aggregation of sensor data

Cited in

(15)

• Succinct summing over sliding windows
• Linking temporal records
• Temporal and spatio-temporal aggregations over data streams using multiple time granularities.
• Improved algorithms for polynomial-time decay and time-decay with additive error
• The Frequent Items Problem in Online Streaming Under Various Performance Measures
• Time-decaying sketches for robust aggregation of sensor data
• Theoretical Computer Science
• Time-decaying sketches for sensor data aggregation
• Improved Algorithms for Time Decay Streams
• Time-decayed correlated aggregates over data streams
• Regular languages in the sliding window model
• How to catch \(L_2\)-heavy-hitters on sliding windows
• Spatially-decaying aggregation over a network
• Combining block-based and online methods in learning ensembles from concept drifting data streams
• The frequent items problem, under polynomial decay, in the streaming model

This page was built for publication: Maintaining time-decaying stream aggregates

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