ACM Home Page
Please provide us with feedback. Feedback
Semantics and implementation of continuous sliding window queries over data streams
Full text PdfPdf (1.33 MB)
Source
ACM Transactions on Database Systems (TODS) archive
Volume 34 ,  Issue 1  (April 2009) table of contents
Article No. 4  
Year of Publication: 2009
ISSN:0362-5915
Authors
Jürgen Krämer  University of Marburg, Germany
Bernhard Seeger  University of Marburg, Germany
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 86,   Downloads (12 Months): 350,   Citation Count: 0
Additional Information:

appendices and supplements   abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1508857.1508861
What is a DOI?

APPENDICES and SUPPLEMENTS
Online appendix to semantics and implementation of continuous sliding window queries over data streams. The appendix supports the information on article 4.


ABSTRACT

In recent years the processing of continuous queries over potentially infinite data streams has attracted a lot of research attention. We observed that the majority of work addresses individual stream operations and system-related issues rather than the development of a general-purpose basis for stream processing systems. Furthermore, example continuous queries are often formulated in some declarative query language without specifying the underlying semantics precisely enough. To overcome these deficiencies, this article presents a consistent and powerful operator algebra for data streams which ensures that continuous queries have well-defined, deterministic results. In analogy to traditional database systems, we distinguish between a logical and a physical operator algebra. While the logical algebra specifies the semantics of the individual operators in a descriptive but concrete way over temporal multisets, the physical algebra provides efficient implementations in the form of stream-to-stream operators. By adapting and enhancing research from temporal databases to meet the challenging requirements in streaming applications, we are able to carry over the conventional transformation rules from relational databases to stream processing. For this reason, our approach not only makes it possible to express continuous queries with a sound semantics, but also provides a solid foundation for query optimization, one of the major research topics in the stream community. Since this article seamlessly explains the steps from query formulation to query execution, it outlines the innovative features and operational functionality implemented in our state-of-the-art stream processing infrastructure.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
4
5
 
6
7
 
8
Barga, R. S., Goldstein, J., Ali, M. H., and Hong, M. 2007. Consistent streaming through time: A vision for event stream processing. In Proceedings of the Conference on Innovative Data Systems Research (CIDR), 363--374.
 
9
 
10
 
11
Chandrasekaran, S., Cooper, O., Deshpande, A., and et al. 2003. TelegraphCQ: Continuous dataflow processing for an uncertain world. In Proceedings of the Conference on Innovative Data Systems Research (CIDR).
 
12
13
14
 
15
16
 
17
 
18
19
 
20
Demers, A. J., Gehrke, J., Panda, B., Riedewald, M., Sharma, V., and White, W. M. 2007. Cayuga: A General purpose event monitoring system. In Proceedings of the Conference on Innovative Data Systems Research (CIDR), 412--422.
 
21
 
22
 
23
 
24
 
25
26
27
28
 
29
 
30
31
32
33
 
34
Kang, J., Naughton, J., and Viglas, S. 2003. Evaluating window joins over unbounded streams. In Proceedings of the International Conference on Data Engineering (ICDE), 341--352.
35
 
36
Krämer, J. 2007. Continuous queries over data streams -- Semantics and implementation. Ph.D. thesis, University of Marburg.
37
 
38
Krämer, J. and Seeger, B. 2005. A temporal foundation for continuous queries over data streams. In Proceedings of the International Conference on Management of Data (COMAD), 70--82.
 
39
40
41
 
42
43
 
44
Patroumpas, K. and Sellis, T. K. 2006. Window specification over data streams. In Proceedings of the EDBT Workshops, 445--464.
 
45
Raman, V., Deshpande, A., and Hellerstein, J. M. 2003. Using state modules for adaptive query processing. In Proceedings of the International Conference on Data Engineering (ICDE), 353.
46
47
 
48
 
49
SQR. 2003. SQR -- A stream query repository. http://www.db.stanford.edu/stream/sqr.
50
 
51
 
52
 
53
 
54
Tucker, P. A., Tufte, K., Papadimos, V., and Maier, D. 2002. NEXMark -- A benchmark for queries over data streams. http://www.cse.ogi.edu/dot/niagara/NEXMark.
55
 
56
 
57
 
58
 
59
60

Collaborative Colleagues:
Jürgen Krämer: colleagues
Bernhard Seeger: colleagues