Time-decaying sketches for sensor data aggregation

DOI10.1145/1281100.1281132MaRDI QIDQ5401414zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Graham Cormode, Srikanta Tirthapura, Bojian Xu

Publication date 13 March 2014

Published in Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.92.2797

zbMATH Keywords

sliding windowssensor networktime decaydata aggregationdistributed streamsdata stream processingasynchronous streamsduplicate insensitive sketch

Mathematics Subject Classification ID

Data structures (68P05) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

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

Cited in

(12)

• Theoretical Computer Science
• Time-decaying sketches for robust aggregation of sensor data
• Spatially-decaying aggregation over a network
• Maintaining time-decaying stream aggregates
• A general method for estimating correlated aggregates over a data stream
• Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks
• Streaming techniques and data aggregation in networks of tiny artefacts
• The eternal sunshine of the sketch data structure
• Improved algorithms for polynomial-time decay and time-decay with additive error
• Improved Algorithms for Time Decay Streams
• The frequent items problem, under polynomial decay, in the streaming model
• Summarizing data using bottom-k sketches

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

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