Streaming techniques and data aggregation in networks of tiny artefacts

DOI10.1016/j.cosrev.2010.09.007zbMath1298.68075OpenAlexW2062038311WikidataQ57608059 ScholiaQ57608059MaRDI QIDQ465668

Ioannis Chatzigiannakis, Yiannis Giannakopoulos, Luca Becchetti

Publication date: 24 October 2014

Published in: Computer Science Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cosrev.2010.09.007

zbMATH Keywords

aggregationdatabase managementdata streamssensor networks

Mathematics Subject Classification ID

Database theory (68P15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (1)

Competitive analysis of maintaining frequent items of a stream

Uses Software

• TAG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An information statistics approach to data stream and communication complexity
• Probabilistic counting algorithms for data base applications
• Selection and sorting with limited storage
• The space complexity of approximating the frequency moments
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
• Min-wise independent permutations
• min-wise independent linear permutations
• Data streams. Models and algorithms.
• Encyclopedia of Database Systems
• Fast, small-space algorithms for approximate histogram maintenance
• Competitive Analysis of Aggregate Max in Windowed Streaming
• Random sampling with a reservoir
• An improved data stream summary: the count-min sketch and its applications
• Sampling algorithms
• Learning from Data Streams
• Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
• Time-decaying sketches for sensor data aggregation
• Algorithms - ESA 2003

This page was built for publication: Streaming techniques and data aggregation in networks of tiny artefacts