Exploiting k-constraints to reduce memory overhead in continuous queries over data streams

ACM Transactions on Database Systems

Volumn 29, Issue 3, 2004, Pages 545-590

  Babu, Shivnath ^a,b   Srivastava, Utkarsh ^a,b   Widom, Jennifer ^a,b  

^a STANFORD UNIVERSITY   (United States)

^b Stanford University   (United States)

Author keywords

Constraints; Continuous queries; Data streams

Indexed keywords

CONSTRAINTS; CONTINUOUS QUERIES; DATA STREAMS; NETWORK MONITORING;

ALGORITHMS; DATA REDUCTION; INTERNET; OPTIMIZATION; PARAMETER ESTIMATION; PROBLEM SOLVING;

DATABASE SYSTEMS;

EID: 7544219531     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/1016028.1016032     Document Type: Article

References (37)

1. AJTAI, M., JAYRAM, T., KUMAR, R., AND SIVAKUMAR, D. 2002. Counting inversions in a data stream. In Proceedings of the 2002 Annual ACM Symposium on Theory of Computing. ACM Press, New York, NY, 370-379.
2. ARASU, A. 2003. CQL Specification of the Linear Road Benchmark. Available online at http://www-db.stanford.edu/stream/cql-benchmark.html.
3. ARASU, A., BABU, S., AND WIDOM, J. 2002. An abstract semantics and concrete language for continuous queries over stream and and relations. Tech. rep. Stanford University, Stanford, CA Available online at http://dbpubs.stanford.edu/pub/2002-57.
4. ARASU, A., CHERNIACK, M. ET AL. 2004. Linear road: A stream data management. benchmark. In Proceedings of the 2004 International Conference on Very Large Data Bases. Morgan Kaufmann, San Mateo, CA.
5. 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 Press, New York, NY, 1-16.
6. BABU, S., MOTWANI, R., MUNAGALA, K., NISHIZAWA, I., AND WIDOM, J. 2004a. Adaptive ordering of pipelined stream filters. In Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data. ACM Press, New York, NY.
7. BABU, S., MUNAGALA, K., WIDOM, J., AND MOTWANI, R. 2004b. Adaptive caching for continuous queries. Tech. rep. Stanford University, Stanford, CA. Available online at http:/dbpubs.stanford.edu/pub/2004-14.
8. BABU, S. AND WIDOM, J. 2004. StreaMon: An adaptive engine for stream query processing (demonstration). In Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data. ACM Press, New York, NY.
9. BLOOM, B. 1970. Space/time tradeoffs in hash coding with allowable errors. Commun. ACM 13, 7, 422-426.
10. CACERES, R. ET AL. 2000. Measurement and analysis of IP network usage and behavior. IEEE Commun. Mag. 38, 5, 144-151.
11. CARNEY, D., CENTINTEMEL, U. ET AL. 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, CA, 215-226.
12. 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, CA, 203-214.
13. 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 Press, New York, NY, 379-390.
14. 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 Press, New York, NY, 647-651.
15. DAS, A., GEHRKE, J., AND RIEDEWALD, M. 2003. Approximate join processing over data streams. In Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data. ACM Press, New York, NY, 40-51.
16. DOBRA, A., GAROFALAKIS, M., 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 Press, New York, NY, 61-72.
17. DUFFIELD, N. AND GROSSGLAUSER, M. 2000. Trajectory sampling for direct traffic observation. In Proceedings of the 2000 ACM SIGCOMM. ACM Press, New York, NY, 271-284.
18. FEIGENBAUM, J., KANNAN, S., STRAUSS, M., AND VISWANATHAN, M. 2000. Testing and spot checking of data streams. In Proceedings of the 2000 Annual ACM-SIAM Symposium on Discrete Algorithms. ACM/SIAM, New York, NY, 165-174.
19. GANGULY, S., GAROFALAKIS, M., AND RASTOGI, R. 2004. Processing data-stream join aggregates using skimmed sketches. In Proceedings of the 9th International Conference on Extending Database Technology. Springer, Berlin, Heidelberg, Germany, 569-586.
20. GARCIA-MOLINA, H., LABIO, W., AND YANG, J. 1998. Expiring data in a warehouse. In Proceedings of the 1998 International Conference on Very Large Data Bases. Morgan Kaufmann, San Mateo, CA, 500-511.
21. GEHRKE, J. 2003. Special issue on data stream processing. IEEE Comput. Soc. Bull. Tech. Comm. Data Eng. 26, 1 (March).
22. GOLAB, L. AND OZSU, T. 2003a. Issues in data stream management. SIGMOD Rec. 32, 2 (June), 5-14.
23. GOLAB, L. AND OZSU, T. 2003b. Processing sliding window multi-joins in continuous queries over data streams. In Proceedings of the 2003 International Conference on Very Large Data Bases. Morgan Kaufmann, San Mateo, CA, 500-511.
24. HAMMAD, M., AREF, W., AND ELMAGARMID, A. 2003. Stream window join: Tracking moving objects in sensor-network databases. In Proceedings of the 2003 International Conference on Scientific and Statistical Database Management. IEEE Computer Society Press, Los Alamitos, CA, 75-84.
25. HELLERSTEIN, J. M., FRANKLIN, M. J. ET AL. 2000. Adaptive query processing: Technology in evolution. IEEE Comput. Soc. Bull. Tech. Comm. Data Eng. 23, 2 (June), 7-18.
26. HELMER, S., WESTMANN, T., AND MOERKOTTE, G. 1998. Diag-join: An opportunistic join algorithm for 1:n relationships. In Proceedings of the 1998 International Conference on Very Large Data Bases. Morgan Kaufmann, San Mateo, CA, 98-109.
27. KANG, J., NAUGHTON, J. F., AND VIGLAS, S. 2003. Evaluating window joins over unbounded streams. In Proceedings of the 2003 International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, CA.
28. MADDEN, S., SHAH, M. A., HELLERSTEIN, 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 Press, New York, NY, 49-60.
29. MOTWANI, R., WIDOM, J. ET AL. 2003. Query processing, approximation, and resource management in a data stream management system. In Proceedings of the 1st Conference on Innovative Data Systems Research. 245-256.
30. NETFLOW. 2003. Netflow Services and Applications. Available online at www.cisco.com/warp/public/732/netflow.
31. RAMAN, V., DESHPANDE, A., AND HELLERSTEIN, J. 2003. Using state modules for adaptive query processing. In Proceedings of the 2003 International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, CA.
32. SQR. 2003. SQR - a Stream Query Repository. Available online at http://www-db.stanford.edu/stream/sqr.
33. SRIVASTAVA, U. AND WIDOM, J. 2004. Memory-limited execution of windowed stream joins. In Proceedings of the 2004 International Conference on Very Large Data Bases. Morgan Kaufmann, San Mateo, CA.
34. TATBUL, N., CETINTEMEL, U., ZDONIK, S., CHERNIACK, M., AND STONEBRAKER, M. 2003. Load shedding in a data stream manager. In Proceedings of the 2003 International Conference on Very Large Data Bases. Morgan Kaufmann, San Mateo, CA, 309-320.
35. 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.
36. URHAN, T., FRANKLIN, M. J., AND AMSALEG, L. 1998. Cost based query scrambling for initial delays. In Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data. ACM Press, New York, NY, 130-141.
37. VIGLAS, S., NAUGHTON, J. F., AND BURGER, J. 2003. Maximizing the output rate of multi-join queries over streaming information sources. la. Proceedings of the 2003 International Conference on Very Large Data Bases. Morgan Kaufmann, San Mateo, CA, 285-296.