Babcock, Brian and Babu, Shivnath and Datar, Mayur and Motwani, Rajeev (2003) Chain: Operator Scheduling for Memory Minimization in Data Stream Systems. In: ACM International Conference on Management of Data (SIGMOD 2003), June 9-12, 2003, San Diego, California .
| BibTeX | DublinCore | EndNote | HTML |
 | There is a more recent version of this item available. |
![[img]](/style/images/fileicons/application_pdf.png)
| PDF 244Kb |
Abstract
In many applications involving continuous data streams, data arrival is bursty and data rate fluctuates over time. Systems that seek to give rapid or real-time query responses in such an environment must be prepared to deal gracefully with bursts in data arrival without compromising system performance. We discuss one strategy for processing bursty streams --- adaptive, load-aware scheduling of query operators to minimize resource consumption during times of peak load. We show that the choice of an operator scheduling strategy can have significant impact on the run-time system memory usage. We then present Chain scheduling, an operator scheduling strategy for data stream systems that is near-optimal in minimizing run-time memory usage for single-stream queries involving selections, projections, and foreign-key joins with stored relations. Chain scheduling also performs well for queries with sliding-window joins over multiple streams, and multiple queries of the above types. A thorough experimental evaluation is provided where we demonstrate the potential benefits of Chain scheduling, compare it with competing scheduling strategies, and validate our analytical conclusions.
| Item Type: | Conference or Workshop Item (Paper) | |
|---|---|---|
| Additional Information: | An extended version of this paper titled "Operator Scheduling in Data Stream Systems" appears on this publications server as technical report 2003-68 at http://dbpubs.stanford.edu/pub/2003-68. This technical report proves an NP-completeness result showing the intractability of the problem of minimizing memory. The report also contains theoretical results and experiments for miminizing run-time memory requirements subject to user-specified latency constraints. | |
| Uncontrolled Keywords: | Data streams, scheduling | |
| Subjects: | Computer Science > Data Streams Miscellaneous | |
| Projects: | STREAM | |
| Related URLs: | Project Homepage | http://infolab.stanford.edu/stream/ |
| ID Code: | 580 | |
| Deposited By: | Import Account | |
| Deposited On: | 08 Mar 2003 16:00 | |
| Last Modified: | 24 Dec 2008 08:25 |
Available Versions of this Item
- Chain: Operator Scheduling for Memory Minimization in Data Stream Systems. (deposited 08 Mar 2003 16:00) [Currently Displayed]
Download statistics
Repository Staff Only: item control page
