A note on efficient aggregate queries in sensor networks
From MaRDI portal
Publication:5501508
Recommendations
- A note on efficient aggregate queries in sensor networks
- A communication-efficient distributed data structure for top-\(k\) and \(k\)-select queries
- Approximate aggregation for tracking quantiles and range countings in wireless sensor networks
- Approximate Top-k Queries in Sensor Networks
- Approximate aggregation for tracking quantiles in wireless sensor networks
Cited in
(14)- Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions
- Approximate aggregation for tracking quantiles in wireless sensor networks
- A note on efficient aggregate queries in sensor networks
- Sketching asynchronous data streams over sliding windows
- A communication-efficient distributed data structure for top-\(k\) and \(k\)-select queries
- Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks
- Approximate distributed top-\(k\) queries
- Approximate aggregation for tracking quantiles and range countings in wireless sensor networks
- Collecting correlated information from a sensor network
- An early-stopping protocol for computing aggregate functions in Sensor Networks
- An efficient ZK compiler from SIMD circuits to general circuits
- The complexity of data aggregation in directed networks
- Secure and highly-available aggregation queries in large-scale sensor networks via set sampling
- Aggregate query processing in the presence of duplicates in wireless sensor networks
This page was built for publication: A note on efficient aggregate queries in sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501508)