Window-Based Query Processing
Data streams are infinite in nature. As a result, a query that executes over data streams specifies a “window” of focus or the part of the data stream that is of interest to the query. When new data items arrive into the data stream, the window may either expand or slide to allow the query to process these new data items. Hence, queries over data streams are continuous in nature, i.e., the query is continuously reevaluated each time the query window slides. Window-based query processing on data streams refers to the various ways and techniques for processing and evaluating continuous queries over windows of data stream items.
Windows over relational tables have already been introduced into standard SQL (SQL:1999) in order to support data analysis, decision support, and, more generally, OLAP-type operations.
However, the motivation for having windows in data stream management systems is quite different. Since data streams...
- 1.Srivastava U, Widom J. Flexible time management in data stream systems. In: Proceedings of 23rd ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems. 2004. p. 263–74.Google Scholar
- 2.Abadi D, Ahmad Y, Balazinska M, Cetintemel U, Cherniack M, Hwang J-H, Lindner W, Maskey AS, Rasin A, Ryvkina E, Tatbul N, Xing Y, Zdonik S. The design of the Borealis stream processing engine. In: Proceedings of 2nd biennial conference on innovative data systems research. 2005. p. 277–89.Google Scholar
- 3.Ryvkina E, Maskey AS, Cherniack M, Zdonik S. Revision processing in a stream processing engine: a high-level design. In: Proceedings of 22nd international conference on data engineering. 2006.Google Scholar
- 6.Chandrasekaran S, Franklin MJ. Streaming queries over streaming data. In: Proceedings of 28th international conference on very large data bases. 2002. p. 203–14.Google Scholar
- 7.Hammad MA, Franklin MJ, Aref WG, Elmagarmid AK Scheduling for shared window joins over data streams. In: Proceedings of 29th international conference on very large data bases. 2003. p. 297–308.Google Scholar
- 8.Jianjun C, DeWitt DJ, Feng T, Yuan W. NiagaraCQ: a scalable continuous query system for internet databases. In: Proceedings of ACM SIGMOD international conference on management of data. 2000. p. 379–90.Google Scholar
- 9.Jianjun C, DeWitt DJ, Naughton JF. Design and evaluation of alternative selection placement strategies in optimizing continuous queries. In: Proceedings of 18th international conference on data engineering. 2002. p. 345–56.Google Scholar
- 10.Madden S, Shah MA, Hellerstein JM, Raman V. Continuously adaptive continuous queries over streams. In: Proceedings of ACM SIGMOD international conference on management of data. 2002. p. 49–60.Google Scholar
- 11.The STREAM Group. STREAM: the stanford stream data manager. IEEE Data Eng Bull. 2003;26(1):19–26.Google Scholar
- 12.Hammad MA, Mokbel MF, Ali MH, Aref WG, Catlin AC, Elmagarmid AK, Eltabakh M, Elfeky MG, Ghanem T, Gwadera R, Ilyas IF, Marzouk M, Xiong X. Nile: a query processing engine for data streams. In: Proceedings of 20th international conference on data engineering. 2004. p. 851.Google Scholar
- 13.Ghanem TM, Elmagarmid AK, Larson PA, Aref WG. Supporting views in data stream management systems. ACM Transactions on Database Systems 35(1), 1:1–1:47 2010.Google Scholar
- 15.Bai Y, Thakkar H, Luo C, Wang H, Zaniolo C. A data stream language and system designed for power and extensibility. In: Proceedings of International Conference on information and knowledge management. 2006. p. 337–46.Google Scholar
- 16.Johnson T, Muthukrishnan S, Shkapenyuk V, Spatscheck O A heartbeat mechanism and its application in gigascope. In: Proceedings of 31st international conference on very large data bases. 2005. p. 1079–88.Google Scholar