Efficient gossip-based aggregate computation

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2006, Pages 308-317

  Kashyap, Srinivas ^a   Deb, Supratim ^b   Naidu, K V M ^b   Rastogi, Rajeev ^b   Srinivasan, Anand ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE; MAX; MIN; RANK; SUM;

AGGREGATES; ALGORITHMS; COMPUTATIONAL METHODS; LARGE SCALE SYSTEMS; NETWORK PROTOCOLS; ROBUST CONTROL;

DATABASE SYSTEMS;

EID: 34250643645     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142351.1142395     Document Type: Conference Paper

References (22)

1. M. Adler, S. Chakrabarti, M. Mitzenmacher, and L. Rasmussen. Parallel randomized load balancing. In Proc. 27th ACM STOC, pages 238-247, 1995.
2. B. Babcock and C. Olston. Distributed top-k monitoring. In Proc. ACM SIGMOD, 2003.
3. M. Bawa, H. Garcia-Molina, A. Gionis, and R. Motwani. Estimating aggregates on a peer-to-peer network. In Technical report, Computer Science Dept., Stanford University, 2003.
4. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Gossip algorithms: Design, analysis and applications. In Proc. IEEE INFOCOM, 2005.
5. J. Chen, G. Pandurangan, and D. Xu. Robust computation of aggregates in wireless sensor networks: Distributed randomized algorithms and analysis. In Proc. 4th IPSN, 2005.
6. G. Cormode, M. Garofalakis, S. Muthukrishnan, and R. Rastogi. Holistic aggregates in a networked world: Distributed tracking of approximate quantiles. In Proc. ACM SIGMOD, pages 25-36, 2005.
7. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database maintenance. In Proc. 6th ACM PODC, pages 1-12, 1987.
8. I. Gupta, R. van Renesse, and K. Birman. Scalable fault-tolerant aggregation in large process groups. In Proc. Conf., on Dependable Systems and Networks, pages 433-442, 2001.
9. M. Jelasity and A. Montresor. Epidemic-style proactive aggregation in large overlay networks. In Proc. 24th ICDCS, pages 102-109, 2004.
10. R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking. Randomized rumor spreading. In Proc. 41st IEEE FOCS, pages 565-574, 2000.
11. D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In Proc. 44th IEEE FOCS, pages 482-491, 2003.
12. S. Madden, M. Franklin, J. Hellerstein, and W. Hong. TAG: a tiny aggregation service for ad-hoc networks. In Proc. 5th OSDI, 2002.
13. S. Madden, M. Franklin, J. Hellerstein, and W. Hong. The design of an acquisitional query processor for sensor networks. In Proc. ACM SIGMOD, 2003.
14. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, USA, 1995.
15. S. Nath, P. Gibbons, S. Seshan, and Z. Anderson. Synopsis diffusion for robust aggregation in sensor networks. In Proc. 2nd ACM SenSys, pages 250-262, 2004.
16. B. Pittel. On spreading a rumor. SIAM J. Applied Math., 47(1):213-223, February 1987.
17. G. Pottie and W. Kaiser. Wireless integrated network sensors. CACM, 43:51-58, 2000.
18. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), pages 329-350, 2001.
19. V. Stemann. Parallel balanced allocations. In Proc. ACM SPAA, pages 261-269, 1996.
20. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. ACM SIGCOMM, pages 149-160, 2001.
21. R. van Renesse, K. Birman, and W. Vogels. Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining. ACM TOCS, May 2003.
22. Y. Yao and J. Gehrke. Query processing in sensor networks. In Proc. 1st CIDR, 2003.