Pagewise preview ]

CategoryValue
Available viahttp://dbpubs.stanford.edu/pub/2004-14
Submitted on 9th of March 2004
Author Babu, Shivnath; Munagala, Kamesh; Widom, Jennifer; Motwani, Rajeev
Title Adaptive Caching for Continuous Queries
Date of publication 2004
Citation Babu, Shivnath; Munagala, Kamesh; Widom, Jennifer; Motwani, Rajeev. Adaptive Caching for Continuous Queries,
Number of pages 24
Language English
Project STREAM
Type Technical Report
Subject group Data Streams; Miscellaneous
Abstract We address the problem of executing continuous multiway join queries in unpredictable and volatile environments. Our query class captures windowed join queries in data stream systems as well as conventional maintenance of materialized join views. Our adaptive approach handles streams of updates whose rates and data characteristics may change over time, as well as changes in system conditions such as memory availability. In this paper we focus specifically on the problem of adaptive placement and removal of caches to optimize join performance. Our approach automatically considers conventional tree-shaped join plans with materialized subresults at every intermediate node, subresult-free MJoins, and the entire spectrum between them. We provide a family of algorithms for selecting candidate caches, monitoring their cost and benefits in current conditions, allocating memory to caches, and adapting as conditions change. All of our algorithms are implemented in the STREAM prototype Data Stream Management System and a thorough experimental evaluation is included.
Keywords Caching; data streams; adaptive optimization
Sponsored by NSF grants IIS-0118173 and IIS-9817799. NIH grant 1HFZ465.
Notes
Fulltext source
  • Postscript (ps, ps.gz, ps.zip)
  • PDF (pdf, pdf.gz, pdf.zip)
  • Plain text (text, text.gz, text.zip)
  • Management of the document byrwesley@stanford.edu

    Pagewise preview ]


    Stanford InfoLab Publication Server