Declarative network monitoring with an underprovisioned query processor

Proceedings - International Conference on Data Engineering

Volumn 2006, Issue , 2006, Pages 56-

  Reiss, Frederick ^a   Hellerstein, Joseph M ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA RATES; PEAK TO AVERAGE RATIO; QUERY PROCESSORS; STEADY STATE CAPACITY;

CHANNEL CAPACITY; COMPUTER NETWORKS; DATA FLOW ANALYSIS; DATA REDUCTION; PROBLEM SOLVING; QUERY LANGUAGES;

DATA PROCESSING;

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

References (33)

1. S. Acharya, P. B. Gibbons, V. Poosala, and S. Ramaswamy. Join synopses for approximate query answering. In SIGMOD, pages 275-286, 1999.
2. A. Arasu, S. Babu, and J. Widom. The cq1 continuous query language: Semantic foundations and query execution. Technical Report 2003-67, Stanford University, 2003.
3. J. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, pages 509-517, 1975.
4. A. Bulut and A. K. Singh. Swat: Hierarchical stream summarization in large networks. In ICDE, 2003.
5. K. Chakrabarti, M. Garofalakis, R. Rastogi, and K. Shim. Approximate query processing using wavelets. VLDB Journal, 10(2-3): 199-223, 2001.
6. S. Chandrasekaran, O. Cooper, A. Deshpande, M. J. Franklin, J. M. Hellerstein, W. Hong, S. Krishnamurthy, S. Madden, V. Raman, F. Reiss, and M. Shah. Telegraphcq: Continuous dataflow processing for an uncertain world. In CIDR, 2003.
7. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. Theor. Comput. Sci., 312(1):3-15, 2004.
8. C. D. Cranor, T. Johnson, O. Spatscheck, and V. Shkapenyuk. Gigascope: A stream database for network applications. In SIG-MOD, 2003.
9. A. Das, J. E. Gehrke, and M. Riedewald. Approximate join processing over data streams. In SIGMOD. ACM Press, 2003.
10. A. Deshpande and J. Hellerstein. On using correlation-based synopses during query optimization. Technical Report CSD-02-1173, U.C. Berkeley EECS Department, May 2002.
11. H. Dreger, A. Feldmann, V. Paxson, and R. Sommer. Operational experiences with high-volume network intrusion detection. In CCS, pages 2-11. ACM Press, 2004.
12. R. M. et al. Query processing, resource management, and approximation in a data stream management system. In CIDR. ACM Press, 2003.
13. M. Garofalakis and P. Gibbons. Approximate query processing: Taming the terabytes!, 2001.
14. A. Gupta and I. S. Mumick. Maintenance of materialized views: Problems, techniques, and applications. IEEE Data Eng. Bull., 18(2):3-18, 1995.
15. G. Iannaccone, C. Diot, and D. McAuley. The CoMo white paper. Technical Report IRC-TR-04-017, Intel Research, September 2004.
16. H. V. Jagadish, N. Koudas, S. Muthukrishnan, V. Poosala, K. C. Sevcik, and T. Suel. Optimal histograms with quality guarantees. In VLDB, pages 275-286, 24-27 1998.
17. J. Kang, J. F. Naughton, and S. D. Viglas. Evaluating window joins over unbounded streams. In. ICDE, 2003.
18. S. Krishnamurthy and M. J. Franklin. Shared hierarchical aggregation over receptor streams. Technical Report UCB-CSD-05-1381, UC Berkeley, 2005.
19. I. Lazaridis and S. Mehrotra. Capturing sensor-generated time series with quality guarantees. In ICDE, 2003.
20. W. E. Leland, M. S. Taqq, W. Willinger, and D. V. Wilson. On the self-similar nature of Ethernet traffic. In D. P. Sidhu, editor, ACM SIGCOMM, pages 183-193, 1993.
21. Y. Matias, J. S. Vitter, and M. Wang. Wavelet-based histograms for selectivity estimation. In SIGMOD, pages 448-459, 1998.
22. Y. Matias, J. S. Vitter, and M. Wang. Dynamic maintenance of wavelet-based histograms. In VLDB, 2000.
23. G. Ozsoyoglu, S. Guruswamy, K. Du, and W.-C. Hou. Time-constrained query processing in CASE-DB. Knowledge and Data Engineering, 7(6):865-884, 1995.
24. V. Paxson and S. Floyd. Wide-area traffic: the failure of Poisson modeling. IEEE Trans. Networking, 3(3):226 - 224, 1995.
25. V. Poosala and Y. Ioannidis. Selectivity estimation without the attribute value independence assumption. In CIDR. ACM Press, 2003.
26. F. Reiss and J. M. Hellerstein. Data triage: An adaptive architecture for load shedding in telegraphcq (short paper). In ICDE, 2005.
27. F. Reiss and J. M. Hellerstein. Declarative network monitoring with an underprovisioned query processor (extended version). Technical report, UC Berkeley, 2006.
28. R. Riedi and W. Willinger. Self-similar Network Traffic and Performance Evaluation. Wiley, 2000.
29. D. V. Schuehler and J. Lockwood. TCP-Splitter: A TCP/IP flow monitor in reconfigurable hardware. In Hot Interconnects, pages 127-131, Stanford, CA, Aug. 2002.
30. U. Srivastava and J. Widom. Memory-limited execution of windowed stream joins, 2004.
31. Y. Tao, J. Sun, and D. Papadias. Selectivity estimation for predictive spatio-temporal queries. In ICDE, 2003.
32. N. Tatbul, U. Centintemel, S. Zdonik, M. Cherniack, and M. Stonebraker. Load shedding in a data stream manager. In VLDB, 2003.
33. J. S. Vitter. Random sampling with a reservoir. ACM Trans. Math. Soflw., 11(1):37-57, 1985.