Update-pattern-aware modeling and processing of continuous Queries

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2005, Pages 658-669

  Golab, Lukasz ^a   Tamer Ozsu M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); DATA PROCESSING; DATA STRUCTURES; DATABASE SYSTEMS; SEMANTICS;

DATA STREAMS; QUERY SEMANTICS; SLIDING WINDOWS; UPDATE-PATTERN-AWARE MODELING;

QUERY LANGUAGES;

EID: 29844451872     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1066157.1066232     Document Type: Conference Paper

References (23)

1. D. Abadi et al. Aurora: A new model and architecture for data stream management. The VLDB Journal, 12(2):120-139, 2003.
2. A. Arasu, B. Babcock, S. Babu, J. McAlister, and J. Widom. Characterizing memory requirements for queries over continuous data streams. ACM Trans. Database Sys., 29(1):162-194, 2004.
3. A. Arasu, S. Babu, and J. Widom. The CQL continuous query language: Semantic foundations and query execution. The VLDB Journal, 14(1), 2005, to appear.
4. A. Ayad and J. Naughton. Static optimization of conjunctive queries with sliding windows over unbounded streaming information sources. SIGMOD 2004, pages 419-430.
5. B. Babcock, S. Babu, M. Datar, R. Motwani, and D. Thomas. Operator scheduling in data stream systems. The VLDB Journal, 13(4):333-353, 2004.
6. S. Babu, R. Motwani, K. Munagala, I. Nishizawa, and J. Widom. Adaptive ordering of pipelined stream filters. SIGMOD 2004, pages 407-418.
7. S. Babu and J. Widom. Exploiting k-constraints to reduce memory overhead in continuous queries over data streams. ACM Trans. Database Sys., 29(3):545-580, 2004.
8. R. Brown. Calendar queues: A fast O(1) priority queue implementation for the simulation event set problem. Communications of the ACM, 31(10):1220-1227, 1988.
9. D. Carney, U. Cetintemel, A. Rasin, S. Zdonik, M. Cherniack, and M. Stonebraker. Operator scheduling in a data stream manager. VLDB 2003, pages 838-849.
10. L. Golab and M. T. Özsu. Processing sliding window multi-joins in continuous queries over data streams. VLDB 2003, pages 500-511.
11. M. Hammad, W. Aref, M. Franklin, M. Mokbel, and A. Elmagarmid. Efficient execution of sliding window queries over data streams. Technical Report CSD TR 03-035, Purdue University, 2003.
12. M. Hammad et al. Nile: a query processing engine for data streams. ICDE 2004, page 851.
13. Q. Jiang and S. Chakravarthy. Scheduling strategies for processing continuous queries over streams. BNCOD 2004, pages 16-30.
14. J. Kang, J. Naughton, and S. Viglas. Evaluating window joins over unbounded streams. ICDE 2003, pages 341-352.
15. J. Krämer and B. Seeger. A temporal foundation for continuous queries over data streams. COMAD 2005, pages 70-82.
16. Y.-N. Law, H. Wang, and C. Zaniolo. Query languages and data models for database sequences and data streams. VLDB 2004, pages 492-503.
17. S. Madden and M. J. Franklin. Fjording the stream: An architecture for queries over streaming sensor data. ICDE 2002, pages 555-566.
18. R. Motwani et al. Query processing, approximation, and resource management in a data stream management system. CIDR 2003, pages 245-256.
19. V. Paxson and S. Floyd. Wide-area traffic: The failure of Poisson modeling. IEEE/ACM Trans. on Networking, 3(3):226-244, 1995.
20. U. Srivastava and J. Widom. Flexible time management in data stream systems. PODS 2004, pages 263-274.
21. D. Terry, D. Goldberg, D. Nichols, and B. Oki. Continuous queries over append-only databases. SIGMOD 1992, pages 321-330.
22. P. Tucker, D. Maier, T. Sheard, and L. Faragas. Exploiting punctuation semantics in continuous data streams. IEEE Trans. Knowledge and Data Eng., 15(3):555-568, 2003.
23. S. Viglas, J. Naughton, and J. Burger. Maximizing the output rate of multi-join queries over streaming information sources. VLDB 2003, pages 285-296.