Efficient detection of distributed constraint violations

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2007, Pages 1320-1324

  Agrawal, Shipra ^a   Deb, Supratim ^b   Naidu, K V M ^b   Rastogi, Rajeev ^b  

^a STANFORD UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; CONSTRAINT THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SYSTEMS ANALYSIS;

DISTRIBUTED SYSTEM VARIABLES; GLOBAL SYSTEMS; MONITORING SOFTWARE;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 34548536332     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2007.369002     Document Type: Conference Paper

References (16)

1. Dartmouth wireless network traces. http://crawdad.cs.dartmouth.edu/data/ dartmouth.html.
2. S. Agrawal, S. Deb, K. V. M. Naidu, and R. Rastogi. Efficient detection of distributed constraint violations. Technical Report ITD-06-46857G, Bell Labs Technical Memorandum, 2006.
3. B. Babcock and C. Olston. Distributed top-k monitoring. In SIGMOD, 2003.
4. T. Corman, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, 1990.
5. M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows. In SODA, 2002.
6. M. Dilman and D. Raz. Efficient reactive monitoring. In INFOCOM, pages 1012-1019, 2001.
7. A. J. et. al. A wakeup call for internet monitoring systems: The case for dist. triggers. In HotNets-III, Nov 2004.
8. C. O. et. al. Adaptive filters for continuous queries over distributed data streams. In SIGMOD, 2003.
9. J. J. et. al. Toward efficient monitoring. In IEEE JSAC, volume 18(5), 2000.
10. K. Y. et. al. Dynamic polling scheme based on time variation of network management information values. In Int. Network Mgmt. Symp., 1999.
11. P. D. et. al. Agent based management of distributed systems with variable polling frequency policies. In Int. Network Mgmt Symp., San Diego, May 1997.
12. R. K. et. al. Communication-efficient dist. monitoring of thresholded counts. In SIGMOD, 2006.
13. M. Greenwald and S. Khanna. Space-efficient online computation of quantile summaries. In SIGMOD, 2001.
14. L. Lee and H. Ting. Maintaining significant stream statistics over sliding windows. In SODA '06, pages 724-732, 2006.
15. P. Moghe and M. Evangelista. An adaptive polling algorithm. In IEEE/IFIT NOMS, February 1998.
16. I. Sharfman, A. Schuster, and D. Keren. A geometric approach to monitoring thresholding functions over distributed data streams. In SIGMOD, 2006.