ACM Home Page
Please provide us with feedback. Feedback
Flexible time management in data stream systems
Full text PdfPdf (237 KB)
Source Symposium on Principles of Database Systems archive
Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems table of contents
Paris, France
SESSION: Data streams table of contents
Pages: 263 - 274  
Year of Publication: 2004
ISBN:158113858X
Authors
Utkarsh Srivastava  Stanford University
Jennifer Widom  Stanford University
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGMOD: ACM Special Interest Group on Management of Data
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 101,   Citation Count: 21
Additional Information:

abstract   references   cited by   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/1055558.1055596
What is a DOI?

ABSTRACT

Continuous queries in a Data Stream Management System (DSMS) rely on time as a basis for windows on streams and for defining a consistent semantics for multiple streams and updatable relations. The system clock in a centralized DSMS provides a convenient and well-behaved notion of time, but often it is more appropriate for a DSMS application to define its own notion of time---its own clock(s), sequence numbers, or other forms of ordering and times-tamping. Flexible application-defined time poses challenges to the DSMS, since streams may be out of order and uncoordinated with each other, they may incur latency reaching the DSMS, and they may pause or stop. We formalize these challenges and specify how to generate heartbeats so that queries can be evaluated correctly and continuously in an application-defined time domain. Our heartbeat generation algorithm is based on parameters capturing skew between streams, unordering within streams, and latency in streams reaching the DSMS. We also describe how to estimate these parameters at run-time, and we discuss how heartbeats can be used for processing continuous queries.


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. CQL: A Language for Continuous Queries over Streams and Relations. In Proc. of the Ninth Intl. Conf. on Database Programming Languages, September 2003.
2
 
3
S. Babu, U. Srivastava, and J. Widom. Exploiting k-constraints to reduce memory overhead in continuous queries over data streams. Technical report, Stanford University Database Group, November 2002. Available at http://dbpubs.stanford.edu/pub/2002--52.
4
5
 
6
S. Chandrasekaran, S. Krishnamurthy, et al. Windows Explained, Windows Expressed. Available at http://www.cs.berkeley.edu/~sirish/research/ streaquel.pdf.
7
 
8
C. Cranor, T. Johnson, O. Spatscheck, and V. Shkapenyuk. The Gigascope Stream Database. IEEE Data Engineering Bulletin, 26(1):27--32, March 2003.
 
9
M. Garey, R. Graham, and D. Johnson. Performance guarantees for scheduling algorithms. Operations Research, 26(1):3--21, January 1978.
 
10
J. Gehrke. Special issue on data stream processing. IEEE Data Engineering Bulletin, 26(1), March 2003.
11
 
12
S. Krishnamurthy, S. Chandrasekaran, et al. TelegraphCQ: An Architectural Status Report. IEEE Data Engineering Bulletin, 26(1):11--18, March 2003.
13
 
14
A. Mukherjee. On the dynamics and significance of low-frequency components of internet load. Internetworking: Research and Experience, 5(4):163--205, December 1994.
 
15
16
17
 
18
SQR A Stream Query Repository. http://www-db.stanford.edu/stream/sqr.
 
19
The STREAM Group. STREAM: The Stanford Stream Data Manager. IEEE Data Engineering Bulletin, 26(1):19--26, March 2003.
 
20
 
21
S. Zdonik, M. Stonebraker, et al. The Aurora and Medusa Projects. IEEE Data Engineering Bulletin, 26(1):3--10, March 2003.

CITED BY  21
Collaborative Colleagues:
Utkarsh Srivastava: colleagues
Jennifer Widom: colleagues