Time-decaying sketches for robust aggregation of sensor data

DOI10.1137/08071795XMaRDI QIDQ3586182zbMATH OpenOpenAlexWikidataFDO

Authors Graham Cormode, Srikanta Tirthapura, Bojian Xu

Publication date 6 September 2010

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/08071795x

zbMATH Keywords

asynchronydata aggregationdata streamsduplicatessensor networktime decay

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15) Analysis of algorithms (68W40)

Recommendations

• Time-decaying sketches for sensor data aggregation
• Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks
• Maintaining time-decaying stream aggregates
• An improved data stream summary: the count-min sketch and its applications
• LATIN 2004: Theoretical Informatics

Cited in

(10)

• Approximating frequent items in asynchronous data stream over a sliding window
• The eternal sunshine of the sketch data structure
• Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks
• Boosting distinct random sampling for basic counting on the union of distributed streams
• Time-decaying sketches for sensor data aggregation
• Maintaining time-decaying stream aggregates
• Improved Algorithms for Time Decay Streams
• Time-decayed correlated aggregates over data streams
• A general method for estimating correlated aggregates over a data stream
• Spatially-decaying aggregation over a network

This page was built for publication: Time-decaying sketches for robust aggregation of sensor data

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