21st International Conference on Data Engineering (ICDE'05) (2005)
Apr. 5, 2005 to Apr. 8, 2005
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDE.2005.15
Shivnath Babu , Stanford University
Kamesh Munagala , Duke University
Jennifer Widom , Stanford University
Rajeev Motwani , Stanford University
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 algorithms for selecting 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.
S. Babu, R. Motwani, K. Munagala and J. Widom, "Adaptive Caching for Continuous Queries," 21st International Conference on Data Engineering (ICDE'05)(ICDE), Tokyo, Japan, 2005, pp. 118-129.