Algorithms for distributed functional monitoring

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 1076-1085

  Cormode, Graham ^a   Muthukrishnan, S ^b   Yi, Ke ^c  

^a AT AND T LABS RESEARCH   (United States)

^b GOOGLE INC   (United States)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED DATABASE SYSTEMS; FREQUENCY ESTIMATION; SENSOR NETWORKS; SIGNAL PROCESSING;

ALGORITHMIC TECHNIQUES; COMMUNICATION COMPLEXITY; COMPUTATION ALGORITHM; DISTRIBUTED FUNCTIONAL MONITORING; DISTRIBUTED SYSTEMS; MONITORING ALGORITHMS; MULTIPLE LEVELS OF DETAIL; UPPER AND LOWER BOUNDS;

MONITORING;

EID: 58449136645     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58:137-147, 1999.
2. B. Babcock and C. Olston. Distributed top-k monitoring. In ACM SIGMOD Intl. Conf. Management of Data, 2003.
3. Z. Bar-Yossef, T. S. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan. Counting distinct elements in a data stream. In RANDOM, 2002.
4. L. Bhuvanagiri, S. Ganguly, D. Kesh, and C. Saha. Simpler algorithm for estimating frequency moments of data streams. In ACM-SIAM Symp. on Discrete Algorithms, 2006.
5. G. Cormode and M. Garofalakis. Sketching streams through the net: Distributed approximate query tracking. In Intl. Conf. Very Large Data Bases, 2005.
6. G. Cormode, M. Garofalakis, S. Muthukrishnan, and R. Rastogi. Holistic aggregates in a networked world: Distributed tracking of approximate quantiles. In ACM SIGMOD Intl. Conf. Management of Data, 2005.
7. G. Cormode, S. Muthukrishnan, and W. Zhuang. What's different: Distributed, continuous monitoring of duplicate resilient aggregates on data streams. In Intl. Conf. on Data Engineering, 2006.
8. G. Cormode, S. Muthukrishnan, and W. Zhuang. Conquering the divide: Continuous clustering of distributed data streams. In Intl. Conf. on Data Engineering, 2007.
9. T. Cover and J. Thomas. Elements of Information Theory. John Wiley and Sons, Inc., 1991.
10. A. Das, S. Ganguly, M. Garofalakis, and R. Rastogi. Distributed set-expression cardinality estimation. In Intl. Conf. Very Large Data Bases, 2004.
11. M. Dilman and D. Raz. Efficient reactive monitoring. In IEEE Infocom, 2001.
12. D. Donoho. Compressed sensing. IEEE Trans. Information Theory, 52(4):1289-1306, April 2006.
13. V. Doshi, D. Shah, M. Médard, and S. Jaggi. Distributed functional compression through graph coloring. In IEEE Data Compression Conf., 2007.
14. L. Huang, X. Nguyen, M. Garofalakis, J. Hellerstein, A. D. Joseph, M. Jordan, and N. Taft. Communication-efficient online detection of network-wide anomalies. In IEEE Infocom, 2007.
15. P. Indyk. Algorithms for dynamic geometric problems over data streams. In ACM Symp. Theory of Computing, 2004.
16. A. Jain, J. Hellerstein, S. Ratnasamy, and D. Wetherall. A wakeup call for internet monitoring systems: The case for distributed triggers. In Proceedings of the 3rd Workshop on Hot Topics in Networks (Hotnets), 2004.
17. P. Juang, H. Oki, Y Wang, M. Martonosi, L. Peh, and D. Rubenstein. Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiments with zebranet. In ASPLOS-X, 2002.
18. R. Keralapura, G. Cormode, and J. Ramamirtham. Communication-efficient distributed monitoring of thresholded counts. In ACM SIGMOD Intl. Conf. Management of Data, 2006.
19. S. Madden, M. Franklin, J. Hellerstein, and W. Hong. Tiny DB: an acquisitional query processing system for sensor networks. ACM Trans. Database Systems, 30(1): 122-173, 2005.
20. S. Muthukrishnan. Data Streams: Algorithms and Applications. Now Publishers, 2005.
21. S. Muthukrishnan. Some algorithmic problems and results in compressed sensing. In Allerton Conference, 2006.
22. I. Sharfman, A. Schuster, and D. Keren. A geometric approach to monitoring threshold functions over distributed data streams. In ACM SIGMOD Intl. Conf. Management of Data, 2006.
23. A. C. Yao. Probabilistic computations: Towards a unified measure of complexity. In IEEE Symp. Foundations of Computer Science, 1977.
24. A. C. Yao. Some complexity questions related to distributive computing. In ACM Symp. Theory of Computing, 1979.