Chain: operator scheduling for memory minimization in data stream systems

By Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev Motwani. ACM SIGMOD Conference, 2003

315 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Information Systems

View Paper: https://www.semanticscholar.org/paper/3f65af4e24697560ee20de26896378fdae2fa135

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Information Systems

Citations in the corpus

Operator Scheduling in a Data Stream Manager (2003, background): “The Chain scheduling algorithm [5] attempts to minimize intermediate queue sizes, an issue that we do not directly address in this paper.”
Load shedding for aggregation queries over data streams (2004, background): “Improving the efficiency of the allocation of memory among query operators, as proposed in [18] and [21], or among inter-operator queues, as in [ 2 ], are alternatives to load shedding that can improve system performance when limited main memory is the primary resource bottleneck.”
Flexible time management in data stream systems (2004, methodology): “The detailed relationship between Chain and operator-level heartbeats is a subject of future work.”
The CQL continuous query language: semantic foundations and query execution (2006, methodology): “We currently use a simple round-robin scheduler, but we intend to incorporate a more appropriate scheduling algorithm based on recent research [7].”
Streaming Pattern Discovery in Multiple Time-Series (2005, background): “The new challenges have made researchers re-think many parts of traditional DBMS design in the streaming context, especially on query processing using correlated attributes [14], scheduling [6, 8], load shedding [35, 12] and memory requirements [5].”
Fault-tolerance in the Borealis distributed stream processing system (2005, background): “Much work has been done on data models and operators [1, 6, 16, 28, 41], efficient processing [7, 8, 12, 30], and resource management [13, 17, 30, 35, 38] for SPEs.”
The Design of the Borealis Stream Processing Engine (2005, background): “Several groups have developed working prototypes [1, 4, 16] and many papers have been published on detailed aspects of the technology such as data models [2, 5, 46], scheduling [8, 15], and load shedding [9, 20, 44].”
Aurora: a new model and architecture for data stream management (2003, background): “Chain [ 6 ] is an operator scheduling algorithm for stream processing streams.”
Issues in data stream management (2003, background): “Since queues may overflow, operators should be scheduled so as to minimize queue sizes and queuing delays [5].”
Distributed data stream processing and edge computing: A survey on resource elasticity and future directions (2017, unknown): “that aims to minimise memory usage and adapt its execution to variations in data arrival rate [49].”