Efficient Gossip-Based Aggregate Computation
Summary: Gossip scheme to compute MIN/MAX/SUM/AVG/RANK w.h.p. on n nodes using O(n log log n) messages and O(log n log log n) rounds. First to beat the O(n log n) message bound, trading a slight round increase for large message savings to cut congestion and energy in sensor/wireless networks. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Srinivas Kashyap
- 2. Supratim Deb
- 3. K. V. M. Naidu
- 4. Rajeev Rastogi
- 5. Anand Srinivasan
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,329 | Streaming in a Connected World: Querying and Tracking Distributed Data Streams | 2007 | SIGMOD | 4.7559363e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 743 | Distributed Top-K Monitoring | 2003 | SIGMOD | 0.00017318557 |
| 881 | Query Processing for Sensor Networks | 2003 | CIDR | 0.00015634948 |
| 903 | The Design of an Acquisitional Query Processor For Sensor Networks | 2003 | SIGMOD | 0.00015449454 |
| 2,934 | Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles | 2005 | SIGMOD | 7.8628636e-05 |
Previous
Page 1 / 1
Next