Chain
Brian Babcock, Shivnath Babu, Rajeev Motwani et al. · Proceedings - ACM-SIGMOD International Conference on Management of Data · 2003
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 any collection of 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.
Cited by 253 works. doi:10.1145/872757.872789
Authors
References
- On the self-similar nature of Ethernet traffic (extended version)
- Wide area traffic: the failure of Poisson modeling
- Models and issues in data stream systems
- Continuous queries over append-only databases
- Monitoring Streams — A New Class of Data Management Applications
- Bursty and hierarchical structure in streams
- Eddies
- Continuously adaptive continuous queries over streams
- Query Processing, Approximation, and Resource Management in a Data Stream Management System.
- Hancock