A note on efficient aggregate queries in sensor networks
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1982191 (Why is no real title available?)
- A note on efficient aggregate queries in sensor networks
- A result in order statistics related to probabilistic counting
- Communication Complexity
- Distributed Computing: A Locality-Sensitive Approach
- LogLog counting of large cardinalities (extended abstract)
- The Probabilistic Communication Complexity of Set Intersection
- The space complexity of approximating the frequency moments
Cited in
(11)- Collecting correlated information from a sensor network
- Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks
- A note on efficient aggregate queries in sensor networks
- Approximate aggregation for tracking quantiles in wireless sensor networks
- The complexity of data aggregation in directed networks
- An early-stopping protocol for computing aggregate functions in Sensor Networks
- Approximate aggregation for tracking quantiles and range countings in wireless sensor networks
- Near-optimal distributed maximum flow
- 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
- Towards worst-case churn resistant peer-to-peer systems
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 Q868957)