Arasu, Arvind and Widom, Jennifer (2004) Resource Sharing in Continuous Sliding-Window Aggregates. Technical Report. Stanford.
We consider the problem of resource sharing when processing large numbers of continuous queries. We specifically address sliding-window aggregates over data streams, an important class of continuous operators for which sharing has not been addressed. We present a suite of sharing techniques that cover a wide range of possible scenarios: different classes of aggregation functions (algebraic, distributive, holistic), different window types (time-based, tuple-based, suffix, historical), and different input models (single stream, multiple substreams). We provide precise theoretical performance guarantees for our techniques, and show their practical effectiveness through a thorough experimental study.
|Item Type:||Techreport (Technical Report)|
|Uncontrolled Keywords:||data streams, continuous queries, resource sharing, sliding windows, aggregates|
|Subjects:||Computer Science > Data Streams|
|Related URLs:||Project Homepage||http://infolab.stanford.edu/stream/|
|Deposited By:||Import Account|
|Deposited On:||09 Mar 2004 16:00|
|Last Modified:||23 Dec 2008 08:36|
Repository Staff Only: item control page