ACM Home Page
Please provide us with feedback. Feedback
Minimizing latency and memory in DSMS: a unified approach to quasi-optimal scheduling
Full text PdfPdf (579 KB)
Source SSPS; Vol. 301 archive
Proceedings of the 2nd international workshop on Scalable stream processing system table of contents
Nantes, France
SESSION: Scheduling, indexing and systems table of contents
Pages 58-67  
Year of Publication: 2008
ISBN:978-159593-963-0
Authors
Yijian Bai  University of California, Los Angeles
Carlo Zaniolo  University of California, Los Angeles
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 43,   Citation Count: 0
Additional Information:

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

ABSTRACT

Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approaches on optimizing memory consumption or response time (i.e., latency) usually produce very different algorithms. In this paper, we extend the popular chart-partitioning procedure, which was previously used for memory optimization on simple operator paths, to minimize latency as well as memory on complex query-graphs with tuple-sharing forks. Furthermore, we test the performance of algorithms that only assume knowledge of the average behavior of tuples and operators, against a theoretical one that assumes detailed knowledge on the behavior of individual tuples. These experiments show that the practical algorithms closely approximate the performance of the optimal ones.


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
Yijian Bai, Hetal Thakkar, Haixun Wang, and Carlo Zaniolo. Optimizing timestamp management in data stream management systems. In ICDE, 2007.
 
5
 
6
 
7
 
8
 
9
 
10
 
11
 
12
R. Motwani et. al. Query processing, approximation, and resource management in a data stream management system. In CIDR, Asilomar, CA, 2003.
13
 
14
15
 
16
Qingchun Jiang and Sharma Chakravarthy. Scheduling strategies for processing continuous queries over streams. In BNCOD, pages 16--30, 2004.
 
17
18
 
19
20

Collaborative Colleagues:
Yijian Bai: colleagues
Carlo Zaniolo: colleagues