ACM Home Page
Please provide us with feedback. Feedback
No pane, no gain: efficient evaluation of sliding-window aggregates over data streams
Full text PdfPdf (1.29 MB)
Source ACM SIGMOD Record archive
Volume 34 ,  Issue 1  (March 2005) table of contents
COLUMN: Research articles and surveys table of contents
Pages: 39 - 44  
Year of Publication: 2005
ISSN:0163-5808
Authors
Jin Li  Portland State University, Portland, OR
David Maier  Portland State University, Portland, OR
Kristin Tufte  Portland State University, Portland, OR
Vassilis Papadimos  Portland State University, Portland, OR
Peter A. Tucker  Whitworth College, Spokane, WA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 51,   Citation Count: 9
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Windows queries are proving essential to data-stream processing. In this paper, we present an approach for evaluating sliding-window aggregate queries that reduces both space and computation time for query execution. Our approach divides overlapping windows into disjoint panes, computes sub-aggregates over each pane, and "rolls up" the pane-aggregates to computer window-aggregates. Our experimental study shows that using panes has significant performance benefits.


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
A. Arasu, S. Babu, and J. Widom. The CQL Continuous Query Language: Semantic Foundations and Query Execution. Stanford University Technical Report, October 2003.
 
2
A. Arasu, J. Widom. Resource Sharing in Continuous Sliding-Window Aggregates. In Proceedings of the 30th International Conference on Very Large Databases (VLDB 2004).
3
 
4
D. Carney et al. Monitoring Streams - A New Class of Data Management Applications. In Proceedings of the 28th International Conference on Very Large Databases (VLDB 2002).
5
6
 
7
S. Chandrasekaran et al. TelegraphCQ: Continuous Dataflow Processing for an Uncertain World. In Proceedings of the 2003 Conference on Innovative Data Systems Research.
 
8
 
9
J. Li et al. Evaluating window aggregate queries over streams. Technical Report, May 2004, OGI/OHSU. http://www.cse.ogi.edu/~jinli/papers/WinAggrQ.pdf
 
10
J. Naughton et al. The Niagara Internet Query System. IEEE Data Engineering Bulletin, 24(2), 27--33, (June 2001).
 
11
U. Srivastava, J. Widom. Flexible Time Management in Data Stream Systems. Technical Report 2003-40, Stanford University, Stanford, CA (July 2003).
 
12
The STREAM Group. STREAM: The Stanford STREAM Data Manager. IEEE Data Engineering Bulletin, 26(1), (March 2003).
 
13
XMark Benchmark. http://www.xml-benchmark.org.

CITED BY  9

Collaborative Colleagues:
Jin Li: colleagues
David Maier: colleagues
Kristin Tufte: colleagues
Vassilis Papadimos: colleagues
Peter A. Tucker: colleagues