DBScholar

Back to papers

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)

Paper ID
1402
Venue
PODS
Year
2006
Pagerank
5.3111776e-05
Overall Rank
9,161 | 37.15%
DOI
10.1145/1142351.1142395

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{kashyap_pods06,
        address = {New York, NY, USA},
        series = {{PODS} '06},
        title = {{Efficient Gossip-Based Aggregate Computation}},
        url = {https://dl.acm.org/doi/10.1145/1142351.1142395},
        doi = {10.1145/1142351.1142395},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Kashyap, Srinivas and Deb, Supratim and Naidu, K. V. M. and Rastogi, Rajeev and Srinivasan, Anand},
        year = {2006}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
7,284 Streaming in a Connected World: Querying and Tracking Distributed Data Streams 2007 SIGMOD 5.6560822e-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
550 Distributed Top-K Monitoring 2003 SIGMOD 0.0001663758
765 Query Processing for Sensor Networks 2003 CIDR 0.00014217472
828 The Design of an Acquisitional Query Processor For Sensor Networks 2003 SIGMOD 0.00013769869
2,406 Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles 2005 SIGMOD 8.6187297e-05
Previous Page 1 / 1 Next

Semantically Similar Papers