Characterizing memory requirements for queries over continuous data streams

ACM Transactions on Database Systems

Volumn 29, Issue 1 SPEC. ISS., 2004, Pages 162-194

  Arasu, Arvind ^a   Babcock, Brian ^a   Babu, Shivnath ^a   McAlister, Jon ^a   Widom, Jennifer ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Continuous queries; Memory requirement; Streams

Indexed keywords

CONTINUOUS QUERIES; EVALUATION ALGORITHMS; MEMORY REQUIREMENTS; STREAMS;

ALGORITHMS; COMPUTER SCIENCE; DATA STORAGE EQUIPMENT; DIGITAL LIBRARIES; MATHEMATICAL MODELS; PROGRAM PROCESSORS; QUERY LANGUAGES;

DATABASE SYSTEMS;

EID: 3042554067     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/974750.974756     Document Type: Conference Paper

References (32)

1. ALON, N., MATIAS, Y., AND SZEGEDY, M. 1999. The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58, 1 (Feb.), 137-147.
2. ARASU, A., BABCOCK, B., BABU, S., MCALISTEH, J., AND WIDOM, J. 2002a. Characterizing memory requirements for queries over continuous data streams. In Proceedings of the 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM, New York, 221-232.
3. ARASU, A., BABU, S., AND WIDOM, J. 2002b. An abstract semantics and concrete language for continuous queries over streams and relations. Tech. Rep. http://dbpubs.stanford.edu/pub/2002-57, Stanford University. Nov.
4. BABCOCK, B., BABU, S., DATAR, M., MOTWANI, R., AND WIDOM, J. 2002. Models and issues in data stream systems. In Proceedings of the 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM, New York, 1-16.
5. BABCOCK, B., DATAR, M., AND MOTWANI, R. 2002. Sampling from a moving window over streaming data. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 633-634.
6. BABU, S. AND WIDOM, J. 2002. Exploiting k-constraints to reduce memory overhead in continuous queries over data streams. Tech. Rep. http://dbpubs.stanford.edu/pub/2002-52, Stanford University. Nov.
7. CARNEY, D., CENTINTEMEL, U., CHERNIACK, M., CONVEY, C., LEE, S., SEIDMAN, G., STONEBRAKER, M., TATBUL, N., AND ZDONIK, S. B. 2002. Monitoring streams - A new class of data management applications. In Proceedings of the 28th International Conference on Very Large Data Bases. Morgan-Kaufmann, San Mateo, Calif., 215-226.
8. CHANDRASEKHARAN, S., COOPER, O., DESHPANDE, A., FRANKLIN, M. J., HELLERSTEIN, J. M., HONG, W., KRISHNAMURTHY, S., MADDEN, S., RAMAN, V., RESIS, F., AND SHAH, M. A. 2003. TelegraphCQ: Continuous dataflow processing for an uncertain world. In Proceedings of the 1st Conference on Innovative Data Systems Research. 269-280.
9. CHANDRASEKHARAN, S. AND FRANKLIN, M. J. 2002. Streaming queries over streaming data. In Proceedings of the 28th International Conference on Very Large Data Bases. Morgan-Kaufmann, San Mateo, Calif., 203-214.
10. CHEN, J., DEWITT, D. J., TIAN, F., AND WANG, Y. 2000. Niagaracq: A scalable continuous query system for internet databases. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data. ACM, New York, 379-390.
11. CHOMICKI, J. 1995. Efficient checking of temporal integrity constraints using bounded history encoding. ACM Trans. Datab. Syst. 20, 2, 149-186.
12. CRANOR, C., JOHNSON, T., SPATASCHEK, O., AND SHKAPENYUK, V. 2003. Gigascope: A stream database for network applications. In Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data. ACM, New York, 647-651.
13. DATAS, M., GIONIS, A., INDYK, P., AND MOTWANI, R. 2002. Maintaining stream statistics over sliding windows. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 635-644.
14. DOBRA, A., GAROFALAKIS, M. N., GEHRKE, J., AND RASTOGI, R. 2002. Processing complex aggregate queries over data streams. In Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data. ACM, New York, 61-72.
15. FEIGENBAUM, J., KANNAN, S., STRAUSS, M., AND VISWANATHAN, M. 1999. An approximate 11-difference algorithm for massive data streams. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 501-511.
16. GEHRKE, J. 2003. Special issue on data stream processing. IEEE Comput. Soc. Bull. Tech. Comm. Data Eng. 26, 1 (Mar.).
17. GEHRKE, J., KORN, F., AND SRIVASTAVA, D. 2001. On computing correlated aggregates over continual data streams. In Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data. ACM, New York, 13-24.
18. GILBERT, A. C., GUHA, S., INDYK, P., MUTHUKRISHNAN, S., AND STRAUSS, M. 2002. Fast, small-space algorithms for approximate histogram maintenance. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing. ACM, New York, 389-398.
19. GOLAB, L. AND OZSU, M. T. 2003. Issues in data stream management. SIGMOD Record 32, 2 (June), 5-14.
20. GRAY, J., CHAUDHURI, S., BOSWORTH, A., LAYMAN, A., REICHART, A., AND VENKATRAO, M. 1997. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. Data Min. Knowl. Disc. 1, 1 (Mar.), 29-53.
21. GREENWALD, M. AND KHANNA, S. 2001. Space-efficient online computation of quantile summaries. In Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data. ACM, New York, 58-66.
22. GUHA, S., KOUDAS, N., AND SHIM, K. 2001. Data-streams and histograms. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing. ACM, New York, 471-475.
23. MADDEN, S., SHAH, M. A., HELLEHSTEIN, J. M., AND RAMAN, V. 2002. Continuously adaptive continuous queries over streams. In Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data. ACM, New York, 49-60.
24. MANKU, G. S., RAJAGOPALAN, S., AND LINDSAY, B. G. 1999. Random sampling techniques for space efficient online computation of order statistics of large datasets. In Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data. ACM, New York, 251-262.
25. SHAH, M., HELLERSTEIN, J. M., CHANDRASEKHARAN, S., AND FRANKLIN, M. J. 2003. Flux: An adaptive partitioning operator for continuous query systems. In Proceedings of the 19th International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, Calif.
26. STREAM. 2003. Stanford stream data management project, http://www-db.stanford.edu/stream.
27. TERRY, D. B., GOLDBERG, D., NICHOLS, D., AND OKI, B. M. 1992. Continuous queries over append-only databases. In Proceedings of the 1992 ACM SIGMOD International Conference on Management of Data. ACM, New York, 321-330.
28. TRADERBOT. 2003. Traderbot home page, http://www.traderbot.com.
29. TUCKER, P. A., MAIER, D., SHEARD, T., AND FEGARAS, L. 2003. Exploiting punctuation semantics in continuous data streams. IEEE Trans. Knowl. Data Eng. 15, 3, 555-568.
30. ULLMAN, J. D. 1988. Principles of Database and Knowledge-Base Systems. Vol. I. Computer Science Press, Rockville, Md., Chapter 3, 121-122.
31. ULLMAN, J. D. 1989. Principles of Database and Knowledge-Base Systems. Vol. II. Computer Science Press, Rockville, Md., Chapter 14, 892-893.
32. VITTER, J. 1985. Random sampling with a reservoir. ACM Trans. Math. Softw. 11, 1 (Mar.), 37-57.