CategoryValue
Available viahttp://dbpubs.stanford.edu/pub/2004-15
Submitted on 10th of March 2004
Author Arasu, Arvind; Widom, Jennifer
Title Resource Sharing in Continuous Sliding-Window Aggregates
Date of publication 2004
Citation Arasu, Arvind; Widom, Jennifer. Resource Sharing in Continuous Sliding-Window Aggregates,
Number of pages 23
Language English
Project STREAM
Type Technical Report
Subject group Data Streams
Abstract 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.
Keywords data streams, continuous queries, resource sharing, sliding windows, aggregates
Fulltext source
  • Postscript (ps, ps.gz, ps.zip)
  • PDF (pdf, pdf.gz, pdf.zip)
  • Management of the document bysiroker@db.stanford.edu


    Stanford InfoLab Publication Server